Travelled to:
1 × Canada
Collaborated with:
D.Dor
Talks about:
decomposit (1) conjectur (1) complet (1) holyer (1) proof (1) graph (1) npc (1)
Person: Michael Tarsi
DBLP: Tarsi:Michael
Contributed to:
Wrote 1 papers:
- STOC-1992-DorT #composition #graph #proving
- Graph Decomposition Is NPC-A Complete Proof of Holyer’s Conjecture (DD, MT), pp. 252–263.