References
- Aho , A. V. , Hopcroft , J. E. and Ullman , J. D. 1974 . The Design and Analysis of Computer Algorithms , Addison-Wesley .
- Akl , A. G. and Toussaint , T. G. 1978 . An improved algorithm to check for polygon similarity . Inform.Process.Lett , 7 : 127 – 128 .
- Booth , K. S. 1980 . Lexicographically least circular substrings . Inform. Process. Lett , 10 ( 5 ) : 240 – 242 .
- Colbourn , C. J. and Booth , K. S. 1981 . Linear time isomorphism algorithms for trees, interval graphs, and planar graphs . SI AM J. Computing , 10 ( 5 ) : 203 – 225 .
- Chen , K. T. , Fox , R. H. and Lyndon , R. C. 1958 . Free differential calculus IV . Ann. of Math , 68 ( 5 ) : 81 – 95 .
- Duval , J. P. 1983 . Factoring words over an ordered alphabet . J. Algorithms , 4 ( 5 ) : 363 – 381 .
- Iliopoulos , C. S. and Smyth , W. F. 1989 . “ PRAM algorithms for identifying polygon similarity ” . In Springer Verlag Lecture Notes in Computer Science 401 Edited by: Djidjev , H. 25 – 32 .
- Knuth , D. E. , Morris , J. and Pratt , V. 1977 . Fast pattern matching in strings . SI AM J. Computing , 6 ( 2 ) : 323 – 350 .
- Shiloach , Y. 1981 . Fast canonization of circular strings . J. Algorithms , 2 ( 2 ) : 107 – 121 .