The Complexity of Finding a Large Subgraph under Anonymity Constraints

DOI10.1007/978-3-642-45030-3_15zbMath1329.05276OpenAlexW20210139MaRDI QIDQ2872080

André Nichterlein, Gerhard J. Woeginger, Robert Bredereck, Sepp Hartung

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_15

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Graph algorithms (graph-theoretic aspects) (05C85)

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 ⋮ A refined complexity analysis of degree anonymization in graphs

This page was built for publication: The Complexity of Finding a Large Subgraph under Anonymity Constraints