A Refined Complexity Analysis of Degree Anonymization in Graphs

DOI10.1007/978-3-642-39212-2_52zbMath1327.68133OpenAlexW2256951937MaRDI QIDQ5327468

Ondřej Suchý, Rolf Niedermeier, Sepp Hartung, André Nichterlein

Publication date: 7 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39212-2_52

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)

Related Items

Privacy in Elections: k-Anonymizing Preference Orders