Abstract
Searching for subgraph isomorphisms is an essential problem in pattern matching. Most of the algorithms use a branch-and-bound method to sequentially assign pattern nodes to compatible nodes in the target graph. It is well known that the order in which nodes are assigned, a so-called search strategy, influences drastically the size of the search space. In this article we investigate the impact of various search strategies on the efficiency of two algorithms, the first being the Ullmann’s algorithm and the second one the recently proposed improvement of Ullmann’s algorithm. From the large set of proposed orders we find the most successful ones by thorough testing on a large database of graphs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Balaban, A.T.: Applications of graph theory in chemistry. Journal of Chemical Information and Computer Sciences 25(3), 334–343 (1985)
Carrington, P.J., Scott, J., Wasserman, S.: Models and methods in social network analysis. Cambridge University Press (2005)
Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Analysis and Machine Intelligence 26(10), 1367–1372 (2004)
De Santo, M., Foggia, P., Sansone, C., Vento, M.: A large database of graphs and its use for benchmarking graph isomorphism algorithms. Pattern Recognition Letters 24(8), 1067–1079 (2003)
Foggia, P., Sansone, C.: A performance comparison of five algorithms for graph isomorphism. In: TC-15 Workshop on Graph-based Representations in Pattern Recognition (2001)
Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In: Proc. of the 3rd IAPR TC-15 International Workshop on Graph-based Representations (2001)
Foggia, P., Sansone, C., Vento, M.: A Performance Comparison of Five Algorithm for Graph Isomorphism. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition (2001)
Fürer, M., Prasad Kasiviswanathan, S.: Approximately counting embeddings into random graphs. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol. 5171, pp. 416–429. Springer, Heidelberg (2008)
Gupta, A., Nishimura, N.: The complexity of subgraph isomorphism for classes of partial k-trees. Theoretical Computer Science 164(1), 287–298 (1996)
He, Y., Evans, A.: Graph theoretical modeling of brain connectivity. Current Opinion in Neurology 23(4), 341–350 (2010)
Krahmer, E., Van Erk, S., Verleg, A.: Graph-based generation of referring expressions. Computational Linguistics 29(1), 53–72 (2003)
Lipets, V., Vanetik, N., Gudes, E.: Subsea: an efficient heuristic algorithm for subgraph isomorphism. Data Mining and Knowledge Discovery 19(3), 320–350 (2009)
Mihelič, J., Čibej, U.: Improvements of ullmann’s algorithm for subgraph isomorphism (submitted for publication, 2013)
Solnon, C.: All Different-based filtering for subgraph isomorphism. Artificial Intelligence 174(12-13), 850–864 (2010)
Ullmann, J.R.: An Algorithm for Subgraph Isomorphism. J. Assoc. for Computing Machinery 23, 31–42 (1976)
Valiente, G.: Algorithms on Trees and Graphs. Springer (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Čibej, U., Mihelič, J. (2014). Search Strategies for Subgraph Isomorphism Algorithms. In: Gupta, P., Zaroliagis, C. (eds) Applied Algorithms. ICAA 2014. Lecture Notes in Computer Science, vol 8321. Springer, Cham. https://doi.org/10.1007/978-3-319-04126-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-04126-1_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04125-4
Online ISBN: 978-3-319-04126-1
eBook Packages: Computer ScienceComputer Science (R0)