A non-factorial algorithm for canonical numbering of a graph
- 30 September 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (3) , 345-362
- https://doi.org/10.1016/0196-6774(84)90015-4
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A nonfactorial algorithm for testing isomorphism of two graphsDiscrete Applied Mathematics, 1983
- Isomorphism of graphs of bounded valence can be tested in polynomial timeJournal of Computer and System Sciences, 1982
- Isomorphism Testing in Hookup ClassesSIAM Journal on Algebraic Discrete Methods, 1982
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Random Graph IsomorphismSIAM Journal on Computing, 1980
- A Theoretical Analysis of Various Heuristics for the Graph Isomorphism ProblemSIAM Journal on Computing, 1980
- A Linear Time Algorithm for Deciding Interval Graph IsomorphismJournal of the ACM, 1979
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970