Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture."

Dorit Dor, Michael Tarsi (1997)

> Home

Details and statistics

DOI: 10.1137/S0097539792229507

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/DorT97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/DorT97
Dorit Dor, Michael Tarsi:
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture. SIAM J. Comput. 26(4): 1166-1187 (1997)

a service of

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.