Abstract
No polynomial time algorithm is known for the graph isomorphism problem. In this paper, we determine graph isomorphism with the help of perfect matching algorithm, to limit the range of search of 1 to 1 correspondences between the two graphs: We reconfigure the graphs into layered graphs, labeling vertices by partitioning the set of vertices by degrees. We prepare a correspondence table by means of whether labels on 2 layered graphs match or not. Using that table, we seek a 1 to 1 correspondence between the two graphs. By limiting the search for 1 to 1 correspondences between the two graphs to information in the table, we are able to determine graph isomorphism more efficiently than by other known algorithms. The algorithm was timed with on experimental data and we obtained a complextity of O(n 4).
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35699-0_19
Chapter PDF
Similar content being viewed by others
Keywords
References
Agrawal, M. and Arvind, V. (1996). A note on decision versus search for graph automorphism. Information and Computation, 131: 179–189.
Akutsu, T. (1988). A polynomial time algorithm for subgraph isomorphism of tree-like graphs. IPSJ 90-AL-17–2.
Babai, L., Erdös, P., and Selkow, S. M. (1980). Random graph isomorphism. SIAM J. Comput., 9: 628–635.
Babai, L., Grigoryev, D. Y., and Mount, D. M. (1982). Isomorphism of graphs with bounded eigenvalue multiplicity. Proc. 14th Annual ACM Symp. Theory of Computing, pages 310–324.
Babai, L. and Luks, E. M. (1983). Canonical labeling of graphs. Proc. 14th Annual ACM Symp. on Theory of Computing, Boston, pages 171–183.
Babel, L., Baumann, S., Ludecke, M., and Tinhofer, G. (1997). Stabcol: Graph isomorphism testing based on the weisfeiler-leman algorithm Technical Report Preprint TUM-M9702, Munich.
Barrett, J. W. and Morton, K. W. (1984). Approximate symmetrization and PetrovGalerkin methods for diffusion-convection problems. Comput. Methods Appl. Mech. Engrg., 45: 97–122.
Booth, K. S. (1978). Isomorphism testing for graphs, semigroups, and finite automata
are polynomially equivalent problems. SIAM J. Comput.,7:273–279.
Corneil, D. G. and Gotlieb, C. C. (1970). An efficient algorithm for graph isomorphism. J. ACM, 17: 51–64.
Cull, P. and Pandy, R. (1994). Isomorphism and the n-queens problem. ACM SIGCSE Bulletin, 26: 29–36.
Filotti, I. S. and Mayer, J. N. (1980). A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. Proc. 12th Annual ACM Symp. Theory of Computing, pages 236–243.
Galil, Z., Hoffmann, C. M., Luks, E. M., Schnorr, C. P., and Weber, A. (1987). An o(n3 log n) deterministic and an o(n3) las vegas isomorphism test for trivalent graphs. J. ACM, 34: 513–531.
Hirata, T. and Inagaki, Y. (1988). Tree pattern matching algorithm. IPSJ 88-AL-4–1. Hop croft, J. and Wong, J. (1974). Linear time algorithms for isomorphism of planar graphs. Proc. 6th Annual ACM Symp. Theory of Computing, pages 172–184.
Iri, M. (1969). Network Flow, Transportation and Scheduling. Academic Press. Köbler, J., Schöning, U., and Torân, J. (1992). Graph isomorphism is low for pp. J. of Computer Complexity, 2: 301–330.
Kreher, D. L. and Stinson, D. R. (1998). Combinational Algorighms: Generation, Enumeration and Search. CRC.
Lueker, G. S. (1979). A linear time algorithm for deciding interval graph isomorphism. J. ACM, 26: 183–195.
Luks, E. M. (1982). Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Computer and System Sciences, 25: 42–65.
Matsuda, Y., Enohara, H., Nakano, H., and Horiuchi, S. (1992). An algorithm for generating regular graphs. IPSJ 92-AL-25–3.
Micah, S. and Vazirani, V. V. (1980). An oWV. • e) algorithm for finding maximum matching in general graphs. Proc. 21st Ann. IEEE Symp. Foundations of Computer Science, pages 17–27.
Torán, J. (2000). On the hardness of graph isomorphism. Proc. 41st Annual Symposium on Foundations of Computer Science, California, pages 180–186.
van Leeuwen, J. (1990). Handbook of Theoretical Computer Science, Vol. A: Algorithmand Complexity. Elseveir.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this paper
Cite this paper
Fukuda, K., Nakamori, M. (2003). Graph Isomorphism Algorithm by Perfect Matching. In: Sachs, E.W., Tichatschke, R. (eds) System Modeling and Optimization XX. CSMO 2001. IFIP — The International Federation for Information Processing, vol 130. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35699-0_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-35699-0_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6669-1
Online ISBN: 978-0-387-35699-0
eBook Packages: Springer Book Archive