A nonfactorial algorithm for testing isomorphism of two graphs
- 30 September 1983
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 6 (3) , 229-236
- https://doi.org/10.1016/0166-218x(83)90078-1
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On the Complexity of Canonical Labeling of Strongly Regular GraphsSIAM Journal on Computing, 1980
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976