A General backtrack algorithm for the isomorphism problem of combinatorial objects
Journal of Symbolic Computation
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Journal of Algorithms
Journal of the ACM (JACM)
An Efficient Algorithm for Graph Isomorphism
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Isomorphism testing for graphs of bounded genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
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
Exploiting structure in symmetry detection for CNF
Proceedings of the 41st annual Design Automation Conference
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computational complexity and the classification of finite simple groups
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Faster symmetry discovery using sparsity of symmetries
Proceedings of the 45th annual Design Automation Conference
Fast Algorithm for Graph Isomorphism Testing
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Errors in graph embedding algorithms
Journal of Computer and System Sciences
Conflict propagation and component recursion for canonical labeling
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Structural and logical approaches to the graph isomorphism problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
We report the current state of the graph isomorphism problem from the practical point of view. After describing the general principles of the refinement-individualization paradigm and pro ving its validity, we explain how it is implemented in several of the key implementations. In particular, we bring the description of the best known program nauty up to date and describe an innovative approach called Traces that outperforms the competitors for many difficult graph classes. Detailed comparisons against saucy, Bliss and conauto are presented.