Skip to content

A Refined Complexity Analysis of Degree Anonymization in Graphs.

Sepp Hartung, Andr Nichterlein, Rolf Niedermeier, Ondrej Such

VenueA*ICALP
Year2013
ProceedingsICALP (2)

Browse the full ICALP paper archive.