Including geometry in graph representations: A quadratic-time graph isomorphism algorithm and its applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1121, Issue , 1996, Pages 110-119

  Jiang, X Y ^a   Bunke, H ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY; PATTERN MATCHING; SET THEORY;

CONCRETE APPLICATIONS; GEOMETRIC INFORMATION; GRAPH ISOMORPHISM; GRAPH ISOMORPHISM PROBLEM; GRAPH MATCHINGS; GRAPH REPRESENTATION; ITS APPLICATIONS; QUADRATIC TIME;

PATTERN RECOGNITION;

EID: 21444456441     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61577-6_12     Document Type: Conference Paper

References (18)

1. H.A. Almohamad and S.O. Duffuaa, A linear programming approach for the weighted graph matching problem, IEEE Trans, on PAMI, 15(5), 522-525, 1993.
2. K.W. Bowyer, C.R. Dyer, Three-dimensional shape representation, in T.Y. Young (Ed.), Handbook of Pattern Recognition and Image Processing: Computer Vision, Academic Press, 17-51, 1994.
3. M. Hanajik, F.J. Kylstra, R.G. van Vilet, An analytical approach to the matching of attributed graphs, Proc. of Scand. Conf. on Image Analysis, 419-425, 1993.
4. J.E. Hopcroft, R.E. Tarjan, A VlogV algorithm for isomorphism of triconnected planar graphs, Journal of Computer and System Sciences, 7, 323-331, 1973.
5. J.E. Hopcroft, J.K. Wong, Linear time algorithm for isomorphism of planar graphs, Proc. of 6th Annual ACM Symposium on Theory of Computing, 172-184, 1974.
6. X.Y. Jiang, H. Bunke, A simple and efficient algorithm for determining the symmetries of polyhedra, CVGIP: GMIP, 54(1), 91-95, 1992.
7. O. Ore, Theory of graphs, Amer. Math. Soc., Providence, RI, 1962.
8. D.S. Seong, Y.K. Choi, H.S. Kim, K.H. Park, An algorithm for optimal isomorphism between two random graphs, Pattern Recognition Letters, 15, 321-327, 1994.
9. R. Shapira, H. Freeman, A cyclic-order property of bodies with tree-face vertices, IEEE Trans, on Computers, 26(10), 1035-1039, 1977.
10. J.R. Ullmann, An algorithm for subgraph isomorphism, JACM, 23(1), 31-42, 1976.
11. S. Umeyama, An eigendecomposition approach to weighted graph matching problems, IEEE Trans, on PAMI, 10(5), 695-703, 1988.
12. R. Wang, H. Freeman, Object recognition based on characteristic view classes, Proc. of Int. Conf. on Pattern Recognition, Vol.1, 8-12, 1990.
13. L. Weinberg, A simple and efficient algorithm for determining isomorphism of planar triply connected graphs, IEEE Trans, on Circuit Theory, 13(2), 142-148, 1966.
14. A.K.C. Wong, M.L. You, Entropy and distance of random graphs with application to structural pattern recognition, IEEE Trans, on PAMI, 7(5), 599-609, 1985.
15. A.K.C. Wong, J. Constant, M.L. You, Random graphs, in H. Bunke, A. Sanfeliu (Eds.), Syntactic and Structural Pattern Recognition - Theory and Applications, World Scientific, 197-234, 1990.
16. A.K.C. Wong, M. You, S.C. Chan, An algorithm for graph optimal monomorphism, IEEE Trans, on System, Man, and Cybernetics, 20(3), 628-636, 1990.
17. H. Yang, J.-W. Tai, On isomorphisms of attributed relational graphs for pattern analysis and a new branch and bound algorithm, Proc. of Int. Conf. on Pattern Recognition, 957-959, 1988.
18. M. You, A.K.C. Wong, An algorithm for graph optimal isomorphism, Proc. of Int. Conf. on Pattern Recognition, 316-319, 1984.