Graph decomposition is NPC - a complete proof of Holyer's conjecture

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Dorit Dor Computer Science Dept., Tel Aviv University, Tel Aviv 69978, Israel
Michael Tarsi Computer Science Dept., Tel Aviv University, Tel Aviv 69978, Israel
Published in:
· Proceeding
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Pages 252-263
ACM New York, NY, USA ©1992
table of contents ISBN:0-89791-511-9 doi>10.1145/129712.129737
Graph decomposition is NPC - a complete proof of Holyer's conjecture Published by ACM 1992 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 10
· Downloads (cumulative): 343
· Citation Count: 11


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder