Additional Key Words and Phrases: backtrack programming, digraph isomorphism, representation of digraphs
Selected references
- D. G. Corneil and C. C. Gotlieb. An efficient algorithm for graph isomorphism. Journal of the ACM, 17(1):51-64, January 1970.
- Robert W. Floyd. Nondeterministic algorithms. Journal of the ACM, 14(4):636-644, October 1967.
- Solomon W. Golomb and Leonard D. Baumert. Backtrack programming. Journal of the ACM, 12(4):516-524, October 1965.
- Lee Krider. A flow analysis algorithm. Journal of the ACM, 11(4):429-436, October 1964.