Approximating degree sequences with regular graphic sequences (extended abstract)

DOI10.1016/J.ENDM.2014.08.036zbMATH Open1337.05034OpenAlexW2010630860MaRDI QIDQ283722FDOQ283722

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Two metrics in a graph theory modeling of organic chemistry
• On the rotation distance of graphs
• Distances between graphs under edge operations
• Edge rotations and distance between graphs
• Title not available (Why is that?)
• On a certain distance between isomorphism classes of graphs
• Title not available (Why is that?)
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• Fast uniform generation of regular graphs

Cited In (3)

• How likely is an LLD degree sequence to be graphical?
• Title not available (Why is that?)
• 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)