Birgit Jenner, Johannes K obler, Pierre McKenzie, and Jacobo Tor an. Completeness results for graph isomorphism. Journal of Computer and Ststem Sciences (JCSS), 66:549--566, 2003. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
An Attempt to Automate NP-Hardness Reductions via SO∃ Logic - Nijjar (2004) (Correct)
No context found.
Birgit Jenner, Johannes K obler, Pierre McKenzie, and Jacobo Tor an. Completeness results for graph isomorphism. Journal of Computer and Ststem Sciences (JCSS), 66:549--566, 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC