Moderately exponential bound for graph isomorphism
- 1 January 1981
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Finite Permutation Groups and Finite Simple GroupsBulletin of the London Mathematical Society, 1981
- Polynomial-time algorithms for permutation groupsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Random Graph IsomorphismSIAM Journal on Computing, 1980
- On the Complexity of Canonical Labeling of Strongly Regular GraphsSIAM Journal on Computing, 1980
- A polynomial-time algorithm for determining the isomorphism of graphs of fixed genusPublished by Association for Computing Machinery (ACM) ,1980
- Isomorphism for graphs embeddable on the projective planePublished by Association for Computing Machinery (ACM) ,1980
- Isomorphism Testing and Symmetry of GraphsPublished by Elsevier ,1980
- Probabilistic analysis of a canonical numbering algorithm for graphsProceedings of Symposia in Pure Mathematics, 1979
- A new algorithm for digraph isomorphismBIT Numerical Mathematics, 1977
- Efficient Planarity TestingJournal of the ACM, 1974