Graph isomorphism is in SPP
By Vikraman Arvind, Piyush P. Kurur. 2002
100 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Algorithms & Complexity
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computational Theory and Mathematics
In Algorithms & Complexity
Citations in the corpus
- The Weisfeiler-Lehman Method and Graph Isomorphism Testing (2011, background): “It is generally considered unlikely to be in NP-complete [2, 21], in part because the corresponding testing and counting problems are polynomial-time equivalent, unlike the apparent case for all other known NP-complete problems.”