Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
- 1 February 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (1), 203-225
- https://doi.org/10.1137/0210015
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Lexicographically least circular substringsInformation Processing Letters, 1980
- Linear Algorithms for Isomorphism of Maximal Outerplanar GraphsJournal of the ACM, 1979
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- A V log V algorithm for isomorphism of triconnected planar graphsJournal of Computer and System Sciences, 1973
- Isomorphism of Planar Graphs (Working Paper)Published by Springer Nature ,1972
- A V2 algorithm for determining isomorphism of planar graphsInformation Processing Letters, 1971
- AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATONPublished by Elsevier ,1971
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- On the order of the group of a planar mapJournal of Combinatorial Theory, 1966