Rankings
Publications
Search Publications
Cited-By Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Login
Register
Home
Publications
Graph decomposition is NPC - a complete proof of Holyer's conjecture
Home
Publications
Graph decomposition is NPC - a complete proof of Holyer's conjecture
Graph decomposition is NPC - a complete proof of Holyer's conjecture
DD
Dorit Dor
Dorit Dor
MT
Michael Tarsi
Michael Tarsi
Publisher Website
Google Scholar
Add to Library
Cite
Download
Share
Download
1 January 1992
proceedings article
Published by
Association for Computing Machinery (ACM)
p.
252-263
https://doi.org/10.1145/129712.129737
Abstract
No abstract available
Cited by 11 articles