Degree-anonymization using edge rotations

DOI10.1016/j.tcs.2021.04.020zbMath1504.68154OpenAlexW3157909119MaRDI QIDQ2034394

Janka Chlebíková, Pierre Cazals, Cristina Bazgan

Publication date: 22 June 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.04.020

zbMATH Keywords

approximation algorithmNP-hardnessdegree-anonymization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• On the rotation distance of graphs
• Distances between graphs under edge operations
• Edge rotation and edge slide distance graphs
• Managing and mining graph data
• Graphic sequences, distances and \(k\)-degree anonymity
• A refined complexity analysis of degree anonymization in graphs
• Edge rotations and distance between graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Rotation and jump distances between graphs
• The Complexity of Degree Anonymization by Vertex Addition
• Finding large degree-anonymous subgraphs is hard

This page was built for publication: Degree-anonymization using edge rotations