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]

Authors

Sepp Hartung

This author has not been identified. Look up 'Sepp Hartung' in Google

André Nichterlein

This author has not been identified. Look up 'André Nichterlein' in Google

Rolf Niedermeier

This author has not been identified. Look up 'Rolf Niedermeier' in Google

Ondrej Suchý

This author has not been identified. Look up 'Ondrej Suchý' in Google