Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture (Q4376161): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123215741, #quickstatements; #temporary_batch_1703710783098 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:08, 7 February 2024
scientific article; zbMATH DE number 1116350
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
