"Finding large degree-anonymous subgraphs is hard."

Cristina Bazgan et al. (2016)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2016.02.004

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/BazganBHNW16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BazganBHNW16
Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger:
Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. 622: 90-110 (2016)

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.