Additional Key Words and Phrases: graph, graph isomorphism, isomorphism, heuristic procedure, strongly regular graph, automorphisms, transitive graphs, coding of graphs, efficient algorithm, effective algorithm, deterministic algorithm, automorphism partitioning, transitive subgraphs
Selected papers that cite this one
- A. T. Berztiss. A backtrack procedure for isomorphism of directed graphs. Journal of the ACM, 20(3):365-377, July 1973.