"A refined complexity analysis of degree anonymization in graphs."

Sepp Hartung et al. (2015)

> Home

Details and statistics

DOI: 10.1016/J.IC.2014.12.017

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/HartungNNS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/HartungNNS15
Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý:
A refined complexity analysis of degree anonymization in graphs. Inf. Comput. 243: 249-262 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.