Search for a unique incidence matrix of a graph
- 1 June 1974
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 14 (2) , 209-226
- https://doi.org/10.1007/bf01932948
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Backtrack Procedure for Isomorphism of Directed GraphsJournal of the ACM, 1973
- An algorithm for determining the automorphism partitioning of an undirected graphBIT Numerical Mathematics, 1972
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- A Simple and Efficient Algorithm for Determining Isomorphism of Planar Triply Connected GraphsIEEE Transactions on Circuit Theory, 1966
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphismCommunications of the ACM, 1964