Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture (Q4376161): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1818115 |
||
| Property / author | |||
| Property / author: Dorit Dor / rank | |||
Revision as of 11:11, 29 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
