The Complexity of Degree Anonymization by Graph Contractions

DOI10.1007/978-3-319-17142-5_23zbMath1459.68158OpenAlexW2396727546WikidataQ62039076 ScholiaQ62039076MaRDI QIDQ2948472

Nimrod Talmon, Sepp Hartung

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17142-5_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex degrees (05C07) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (6)

The complexity of degree anonymization by graph contractions ⋮ The complexity of degree anonymization by vertex addition ⋮ Graph editing to a given degree sequence ⋮ Graph Editing to a Given Degree Sequence ⋮ Finding large degree-anonymous subgraphs is hard ⋮ Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics

This page was built for publication: The Complexity of Degree Anonymization by Graph Contractions