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