Abstract
We propose a new approach to solve graph isomorphism using parameterized matching. To find isomorphism between two graphs, one graph is linearized, i.e., represented as a graph walk that covers all nodes and edges such that each element is represented by a parameter. Next, we match the graph linearization on the second graph, searching for a bijective function that maps each element of the first graph to an element of the second graph. We develop an efficient linearization algorithm that generates short linearization with an approximation guarantee, and develop a graph matching algorithm. We evaluate our approach experimentally on graphs of different types and sizes, and compare to the performance of VF2, which is a prominent algorithm for graph isomorphism. Our empirical measurements show that graph linearization finds a matching graph faster than VF2 in many cases because of better pruning of the search space.
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-3-319-02432-5_33
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amir, A., Aumann, Y., Cole, R., Lewenstein, M., Porat, E.: Function matching: Algorithms, applications, and a lower bound. In: Proc. 30th International Colloquium on Automata, Languages and Programming (2003)
Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Information Processing Letters 49(3), 111–115 (1994)
Apostolico, A., Giancarlo, R.: Periodicity and repetitions in parameterized strings. Discrete Applied Mathematics 156(9), 1389–1398 (2008)
Baker, B.: A theory of parameterized pattern matching: algorithms and applications. In: Proc. 25th Annual Symposium on Theory of Computing (1993)
Baker, B.: Parameterized pattern matching by Boyer-Moore-type algorithms. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, p. 550. Society for Industrial and Applied Mathematics (1995)
Baker, B.: Parameterized pattern matching: algorithms and applications. J. Comput. Syst. Sci. 52(1), 28–42 (1996)
Baker, B.: Parameterized duplication in strings: algorithms and an application to softwaremaintenance. SIAM Journal on Computing 26(5), 1343–1362 (1997)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence 18(03), 265–298 (2004)
Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub) graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(10), 1367–1372 (2004)
Du Mouza, C., Rigaux, P., Scholl, M.: Parameterized pattern queries. Data & Knowledge Engineering 63(2), 433–456 (2007)
Edmonds, J., Johnson, E.L.: Matching, euler tours and the chinese postman. Mathematical Programming 5(1), 88–124 (1973)
Fredriksson, K., Mozgovoy, M.: Efficient parameterized string matching. Information Processing Letters 100(3), 91–96 (2006)
Hazay, C.: Parameterized matching. Master’s thesis, Bar-Ilan University (2004)
Hazay, C., Lewenstein, M., Sokol, D.: Approximate parameterized matching. ACM Transactions on Algorithms 3(3), 29 (2007)
Hazay, C., Lewenstein, M., Tsur, D.: Two dimensional parameterized matching. In: CPM, pp. 266–279 (2005)
Kosaraju, S.: Faster algorithms for the construction of parameterized suffix trees. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Washington, DC (1995)
Lee, I., Mendivelso, J., Pinzón, Y.J.: δγ – parameterized matching. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 236–248. Springer, Heidelberg (2008)
Lewenstein, M.: Parameterized matching. In: Encyclopedia of Algorithms. Springer (2008)
McKay, B.D.: Practical graph isomorphism. Congressus Numerantium 30, 45 (1981)
Mendivelso, J., Lee, I., Pinzón, Y.J.: Approximate function matching under δ- and γ- distances. In: Calderón-Benavides, L., González-Caro, C., Chávez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 348–359. Springer, Heidelberg (2012)
Salmela, L., Tarhio, J.: Sublinear algorithms for parameterized matching. In: Proc. 17th Annual Symposium on Combinatorial Pattern Matching (2006)
Ullmann, J.R.: An algorithm for subgraph isomorphism. Journal of the ACM (JACM) 23(1), 31–42 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mendivelso, J., Kim, S., Elnikety, S., He, Y., Hwang, Sw., Pinzón, Y. (2013). Solving Graph Isomorphism Using Parameterized Matching. In: Kurland, O., Lewenstein, M., Porat, E. (eds) String Processing and Information Retrieval. SPIRE 2013. Lecture Notes in Computer Science, vol 8214. Springer, Cham. https://doi.org/10.1007/978-3-319-02432-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-02432-5_26
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02431-8
Online ISBN: 978-3-319-02432-5
eBook Packages: Computer ScienceComputer Science (R0)