Graphic sequences, distances and \(k\)-degree anonymity

DOI10.1016/j.dam.2015.03.005zbMath1311.05036OpenAlexW2084194677MaRDI QIDQ2345626

Julián Salas, Vincenç Torra

Publication date: 22 May 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.03.005

zbMATH Keywords

regular graphdegree sequence\(k\)-anonymitygraphic sequenceedge rotation distancegraph distancerectilinear distance\(k\)-degree anonymity

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (3)

Some basics on privacy techniques, anonymization and their big data challenges ⋮ Improving the characterization of P-stability for applications in network privacy ⋮ Degree-anonymization using edge rotations

Cites Work

• Unnamed Item
• Unnamed Item
• Two metrics in a graph theory modeling of organic chemistry
• On the rotation distance of graphs
• Distances between graphs under edge operations
• Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs
• Edge rotations and distance between graphs
• On a certain distance between isomorphism classes of graphs
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY

This page was built for publication: Graphic sequences, distances and \(k\)-degree anonymity