k-Tree Power Is NP-Complete.">k-Tree Power Is NP-Complete., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"Bounded Degree Closest k-Tree Power Is NP-Complete."

Michael Dom, Jiong Guo, Rolf Niedermeier (2005)

> Home

Details and statistics

DOI: 10.1007/11533719_77

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/DomGN05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/DomGN05
Michael Dom, Jiong Guo, Rolf Niedermeier:
Bounded Degree Closest k-Tree Power Is NP-Complete. COCOON 2005: 757-766

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.