Graph Decomposition Is NPC-A Complete Proof of Holyer’s Conjecture
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Dorit Dor, Michael Tarsi
Graph Decomposition Is NPC-A Complete Proof of Holyer’s Conjecture
STOC, 1992.

STOC 1992
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1992-DorT,
	author        = "Dorit Dor and Michael Tarsi",
	booktitle     = "{Proceedings of the 24th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/129712.129737",
	isbn          = "0-89791-511-9",
	pages         = "252--263",
	publisher     = "{ACM}",
	title         = "{Graph Decomposition Is NPC-A Complete Proof of Holyer’s Conjecture}",
	year          = 1992,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.