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 |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Dorit Dor / rank | |||
| Property / author | |||
| Property / author: Dorit Dor / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539792229507 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964448775 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:31, 30 July 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
