Practical graph isomorphism, II
Brendan D. McKay, Adolfo Piperno · Journal of Symbolic Computation · 2013
Cited by 1,597 works. doi:10.1016/j.jsc.2013.09.003
Authors
References
- The Design and Analysis of Computer Algorithms
- An Efficient Algorithm for Graph Isomorphism
- Proceedings 35th Annual Symposium on Foundations of Computer Science
- Proceedings of the 55th Annual ACM Symposium on Theory of Computing
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- The graph isomorphism disease
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Isomorphism testing for graphs of bounded genus
- Combinatorial Mathematics
- Permutation Group Algorithms