Degree-anonymization using edge rotations
type: Item
instance of: scholarly article
title: Degree-anonymization using edge rotations
zbMATH Open document ID: 1504.68154
author: Cristina Bazgan
author: Pierre Cazals
author: Janka Chlebíková
published in: Theoretical Computer Science
publication date: 2021-06-22T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7361595
zbMATH Keywords: degree-anonymization
zbMATH Keywords: NP-hardness
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.04.020
OpenAlex ID: W3157909119
cites work: Finding large degree-anonymous subgraphs is hard
cites work: The Complexity of Degree Anonymization by Vertex Addition
cites work: Rotation and jump distances between graphs
cites work: Edge rotations and distance between graphs
cites work: Q3287781
cites work: On the rotation distance of graphs
cites work: Q4198056
cites work: Distances between graphs under edge operations
cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
cites work: A refined complexity analysis of degree anonymization in graphs
cites work: Edge rotation and edge slide distance graphs
cites work: Graphic sequences, distances and \(k\)-degree anonymity
cites work: Managing and mining graph data
DOI: 10.1016/J.TCS.2021.04.020
description: scientific article; zbMATH DE number 7361595