A refined complexity analysis of degree anonymization in graphs

Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý. A refined complexity analysis of degree anonymization in graphs. Inf. Comput., 243:249-262, 2015. [doi]

Abstract

Abstract is missing.