The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A clique problem equivalent to graph isomorphism
ACM SIGACT News
ACM SIGACT News
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
On the hardness of finding symmetries in Markov decision processes
Proceedings of the 25th international conference on Machine learning
The Structure of Level-k Phylogenetic Networks
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
On the automorphism groups of strongly regular graphs I
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
An open question is the computational complexity of recognizing when two graphs are isomorphic. In an attempt to answer this question we shall analyze the relative computational complexity of generalizations and restrictions of the graph isomorphism problem. In the first Section we show graph isomorphism of regular undirected graphs is complete over isomorphism of explicitly given structures (say Tarski models from logic). Then we show that valence seems to be important. Finally we analyze symmetric cubic graphs.