Optimal quadratic-time isomorphism of ordered graphs

Pattern Recognition

Volumn 32, Issue 7, 1999, Pages 1273-1283

  Jiang, Xiaoyi ^a   Bunke, Horst ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Graph coding; Graph isomorphism; Ordered graph; Polynomial algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EDGE DETECTION; ENCODING (SYMBOLS); GRAPH THEORY;

GRAPH CODING; GRAPH ISOMORPHISM; ORDERED GRAPH; POLYNOMIAL ALGORITHM;

PATTERN RECOGNITION;

EID: 0033165432     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(98)00145-9     Document Type: Article

References (30)

1. [1] C. Berge, Graphs. North-Holland, Amsterdam, 1985.
2. [2] N. Christofides, Graph Theory: An Algorithmic Approach, Academic Press, New York, 1975.
3. [3] S. Even, Graph Algorithms, Pitman, London, 1979.
4. [4] F. Harary, Graph Theory, Addison-Wesley, Reading MA, 1972.
5. [5] O. Ore, Theory of Graphs, American Mathematical Society, Providence, RI, 1962.
6. [6] R. Wang, H. Freeman, Object recognition based on characteristic view classes, Proc. Int. Conf. on Pattern Recognition, vol. I, 1990, pp. 8-12.
7. [7] R. Wang, H. Freeman, From characteristic views to canonical views, In: V. Cantoni et al. (Eds.), Progress in Image Analysis and Processing, World Scientific, Singapore, 1992, pp. 400-413.
8. [8] G. Gati, Further annotated bibliography on the isomorphism disease, J. Graph Theory 3 (1979) 95-109.
9. [9] R.C. Read, D.G. Corneil, The graph isomorphism disease, J. Graph Theory 1 (1977) 339-363.
10. [10] U. Schöning, Graph isomorphism is in the low hierarchy, J. Comput. System Sci. 37 (1988) 312-323.
11. [11] E.M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, J. Comput. System Sci 25 (1982) 42-65.
12. [12] J.E. Hopcroft, R.E. Tarjan, A Vlog V algorithm for isomorphism of triconnected planar graphs, J. Comput. System Sci. 7 (1973) 323-331.
13. [13] J.E. Hopcroft, J.K. Wong, Linear time algorithm for isomorphism of planar graphs, Proc. 6th Ann. ACM Symp. on Theory of Computing, 1974, pp. 172-184.
14. [14] L. Weinberg, A simple and efficient algorithm for determining isomorphism of planar triply connected graphs, IEEE Trans. Circuit Theory, 13 (2) (1966) 142-148.
15. [15] A.V. Aho et al., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
16. [16] K.S. Booth, G.S. Lueker, A linear-time algorithm for deciding interval graph isomorphism, JACM 26 (1979) 183-195.
17. [17] G.J. Colbourn, On testing isomorphism of permutation graphs, Networks 11 (1981) 13-21.
18. [18] L. Babel, Isomorphism of chordal (6, 3) graphs, Computing, 54(1995)303-316.
19. [19] G.L. Miller, Isomorphism testing for graphs with bounded genus, Proc. 12th ACM Symp. on Theory of Computing, 1980, pp. 225-235.
20. [20] H.L. Bodlaender, Polynomial algorithms for graph isomorphism and chromatic index on partial k-tress, J. Algorithms, 11 (1990) 631-643.
21. [21] L. Babai et al., Isomorphism of graphs with bounded eigenvalue multiplicity, Proc. 14th ACM Symp. on Theory of Computing, 1982, pp. 310-324.
22. [22] L. Babel et al., The isomorphism problem for directed path graphs and for rooted directed path graphs, J. Algorithms 21 (1996) 542-564.
23. [23] R.C. Read, A census of cubical 3-connected plane graphs, Technical Report UWI/CC11, University of the West Indies, Jamaica, 1967.
24. [24] D. Barnette, Map Coloring, Polyhedra, and the Four-color Problem, The Mathematical Association of America, 1983.
25. [25] J.R. Ullmann, An algorithm for subgraph isomorphism, J. Assoc. Comput. Mach. 23 (1) (1976) 31-42.
26. [26] F.R. Preparata, M.I. Shamos, Computational Geometry, Springer, New York, 1985.
27. [27] L. Weinberg, Plane representations and codes for planar graphs, Proc. 3rd Ann Allerton Conf. on Circuit and System Theory, 1965, pp. 733-744.
28. [28] A.K.C. Wong, M.L. You, Entropy and distance of random graphs with application to structural pattern recognition, IEEE Trans. Pattern Anal. Mach. Intell. 7(5) (1985) 599-609.
29. [29] A.K.C. Wong et al. Random graphs, in: H. Bunke, A. Sanfeliu (Eds.), Syntactic and Structural Pattern Recognition - Theory and Applications, World Scientific, Singapore, 1990, pp. 197-234.
30. [30] D.S. Seong et al., An algorithm for optimal isomorphism between two random graphs, Pattern Recognition Lett. 15 (1994) 321-327.