Approximating degree sequences with regular graphic sequences (extended abstract)

DOI10.1016/J.ENDM.2014.08.036MaRDI QIDQ283722zbMATH OpenOpenAlexFDO

Authors J. Salas, Vicenç Torra

Publication date 13 May 2016

Full work available at URL https://doi.org/10.1016/j.endm.2014.08.036

zbMATH Keywords

edit distance\(k\)-anonymitydegree sequences distanceedge rotation distancegraph distance

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12)

Recommendations

• Graphic sequences, distances and \(k\)-degree anonymity
• Degree-anonymization using edge rotations
• Parameterized inapproximability of degree anonymization
• A refined complexity analysis of degree anonymization in graphs
• The complexity of degree anonymization by vertex addition

Cites work

• scientific article; zbMATH DE number 3930782 (Why is no real title available?)
• scientific article; zbMATH DE number 747036 (Why is no real title available?)
• Distances between graphs under edge operations
• Edge rotations and distance between graphs
• Fast uniform generation of regular graphs
• On a certain distance between isomorphism classes of graphs
• On the rotation distance of graphs
• Two metrics in a graph theory modeling of organic chemistry
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY

Cited in

(3)

• How likely is an LLD degree sequence to be graphical?
• scientific article; zbMATH DE number 7650942 (Why is no real title available?)
• On the approximate shape of degree sequences that are not potentially \(H\)-graphic

This page was built for publication: Approximating degree sequences with regular graphic sequences (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283722)