Login / Signup

Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture.

Dorit DorMichael Tarsi
Published in: SIAM J. Comput. (1997)
Keyphrases