Parameterized Inapproximability of Degree Anonymization

DOI10.1007/978-3-319-13524-3_7zbMath1456.68062OpenAlexW165003445MaRDI QIDQ2946009

André Nichterlein, Cristina Bazgan

Publication date: 15 September 2015

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13524-3_7

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex degrees (05C07) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (5)

The complexity of degree anonymization by graph contractions ⋮ The complexity of degree anonymization by vertex addition ⋮ Finding large degree-anonymous subgraphs is hard ⋮ Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack ⋮ A refined complexity analysis of degree anonymization in graphs

This page was built for publication: Parameterized Inapproximability of Degree Anonymization