"A Refined Complexity Analysis of Degree Anonymization in Graphs."

Sepp Hartung et al. (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-39212-2_52

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/HartungNNS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/HartungNNS13
Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý:
A Refined Complexity Analysis of Degree Anonymization in Graphs. ICALP (2) 2013: 594-606

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.