Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture (Q4376161)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1116350
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture |
scientific article; zbMATH DE number 1116350 |
Statements
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture (English)
0 references
10 February 1998
0 references
\(H\)-decomposition of a graph
0 references
NP-completeness
0 references
0.93439746
0 references
0.9023316
0 references
0 references
0 references
0.88168263
0 references
0 references
0.8779713
0 references
0 references
