A new algorithm for digraph isomorphism
- 1 March 1977
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 17 (1) , 16-30
- https://doi.org/10.1007/bf01932396
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Graph isomorphism: A heuristic edge-partitioning-oriented algorithmComputing, 1974
- Search for a unique incidence matrix of a graphBIT Numerical Mathematics, 1974
- A Backtrack Procedure for Isomorphism of Directed GraphsJournal of the ACM, 1973
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Isomorphism of Planar Graphs (Working Paper)Published by Springer Nature ,1972
- Cospectral Graphs and DigraphsBulletin of the London Mathematical Society, 1971
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- A Graph-Theoretic Algorithm for Matching Chemical Structures.Journal of Chemical Documentation, 1965