January 1, 1992· Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92
conference-paper
Graph decomposition is NPC - a complete proof of Holyer's conjecture
Authors:Dorit DorMichael Tarsi
Abstract
No abstract metadata is available for this record.
Community
0 commentsUse Connect Wallet in the navigation
No discussion yet
Be the first to share a question or observation.