Degree-anonymization using edge rotations
Saved in:
| Title: | Degree-anonymization using edge rotations |
|---|---|
| Authors: | Bazgan, Cristina, Cazals, Pierre, Chlebíková, Janka |
| Source: | Theoretical Computer Science. 873:1-15 |
| Publisher Information: | Elsevier BV, 2021. |
| Publication Year: | 2021 |
| Subject Terms: | Programmation, Degree-anonymization, NP-hardness, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Approximation algorithm, 01 natural sciences, logiciels, organisation des données |
| Description: | The Min Anonymous-Edge-Rotation problem asks for an input graph G and a positive integer k to find a minimum number of edge rotations that transform G into a graph such that for each vertex there are at least k − 1 other vertices of the same degree (a k-degree-anonymous graph). In this paper, we prove that the Min Anonymous-Edge-Rotation problem is NP-hard even for k = n / q , where n is the order of a graph and q any positive integer, q ≥ 3 . We argue that under some constrains on the number of edges in a graph and k, Min Anonymous-Edge-Rotation is polynomial-time 2-approximable. Furthermore, we show that the problem is solvable in polynomial time for any graph when k = n and for trees when k = θ ( n ) . Additionally, we establish sufficient conditions for an input graph and k such that a solution for Min Anonymous-Edge-Rotation exists. |
| Document Type: | Article |
| File Description: | application/pdf |
| Language: | English |
| ISSN: | 0304-3975 |
| DOI: | 10.1016/j.tcs.2021.04.020 |
| Access URL: | https://dblp.uni-trier.de/db/journals/tcs/tcs873.html#BazganCC21 https://www.sciencedirect.com/science/article/pii/S0304397521002413 https://researchportal.port.ac.uk/en/publications/degree-anonymization-using-edge-rotations https://puredev.port.ac.uk/en/publications/degree-anonymization-using-edge-rotations https://doi.org/10.1016/j.tcs.2021.04.020 |
| Rights: | Elsevier Non-Commercial |
| Accession Number: | edsair.doi.dedup.....91211a4031f71f20f1047a031cf6cb1e |
| Database: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstract: | The Min Anonymous-Edge-Rotation problem asks for an input graph G and a positive integer k to find a minimum number of edge rotations that transform G into a graph such that for each vertex there are at least k − 1 other vertices of the same degree (a k-degree-anonymous graph). In this paper, we prove that the Min Anonymous-Edge-Rotation problem is NP-hard even for k = n / q , where n is the order of a graph and q any positive integer, q ≥ 3 . We argue that under some constrains on the number of edges in a graph and k, Min Anonymous-Edge-Rotation is polynomial-time 2-approximable. Furthermore, we show that the problem is solvable in polynomial time for any graph when k = n and for trees when k = θ ( n ) . Additionally, we establish sufficient conditions for an input graph and k such that a solution for Min Anonymous-Edge-Rotation exists. |
|---|---|
| ISSN: | 03043975 |
| DOI: | 10.1016/j.tcs.2021.04.020 |