Searching for "Graph Decomposition is NP-Complete A Complete Proof of Holyer's Conjecture." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Graph Decomposition Is NP-Complete: A Complete Proof Of Holyer's Conjecture
by Dorit Dor, Michael Tarsi, Siam J. Comput C — 1997 — SIAM J. Comput
…GRAPH DECOMPOSITION IS NP-COMPLETE: A COMPLETE PROOF OF HOLYER'S CONJECTURE # DORIT DOR…
Cited by 11 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB