Abstract
We study the induced subgraph isomorphism problem and the general subgraph isomorphism problem for small pattern graphs.
We present a new general method for detecting induced subgraphs of a host graph isomorphic to a fixed pattern graph by reduction to polynomial testing for non-identity with zero over a field of finite characteristic. It yields new upper time bounds for several pattern graphs on five vertices and provides an alternative combinatorial method for the majority of pattern graphs on four and three vertices. Since our method avoids the large overhead of fast matrix multiplication, it can be of practical interest even for larger pattern graphs.
Next, we derive new upper time bounds on counting the number of isomorphisms between a fixed pattern graph with an independent set of size s and a subgraph of the host graph. We also consider a weighted version of the counting problem, when one counts the number of isomorphisms between the pattern graph and lightest subgraphs, providing a slightly slower combinatorial algorithm.
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
Alon, N., Dao, P., Hajirasouliha, I., Hormozdiari, F., Sahinalp, S.C.: Biomolecular network motif counting and discovery by color coding. Bioinformatics (ISMB 2008) 24(13), 241–249 (2008)
Björklund, A.: Determinant sums for undirected Hamiltonicity. In: Proc. of FOCS 2010, pp. 173–182 (2010)
Corneil, D.G., Perl, Y., Stewart, L.K.: A Linear Recognition Algorithm for Cographs. SIAM J. Comput. 14(4), 926–934 (1985)
Czumaj, A., Lingas, A.: Finding a Heaviest Vertex-Weighted Triangle is not Harder than Matrix Multiplication. SIAM J. Comput. 39(2), 431–444 (2009)
DeMillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Information Processing Letters 7, 193–195 (1978)
Edmonds, J.: Systems of distinct representatives and linear algebra. J. Res. Nat. Bur. Standards Sect. B 7B1, 241–245 (1967)
Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science 326(1:3), 57–67 (2004)
Floderus, P., Kowaluk, M., Lingas, A., Lundell, E.-M.: Induced subgraph isomorphism: Are some patterns substantially easier than others? In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 37–48. Springer, Heidelberg (2012)
Fomin, F.V., Lokshtanov, D., Raman, V., Rao, B.V.R., Saurabh, S.: Faster Algorithms for Finding and Counting Subgraphs. J. Comput. and Syst. Sci. 78(3), 698–706 (2012)
Gelbord, B.: Graphical techniques in intrusion detection systems. In: Proceedings 15th International Conference on Information Networks, pp. 253–258 (2001)
Hoang, C.T., Kaminski, M., Sawada, J., Sritharan, R.: Finding and listing induced paths and cycles. Discrete Applied Mathematics 161(4-5), 633–641 (2013)
Kloks, T., Kratsch, D., Müller, H.: Finding and counting small induced subgraphs efficiently. Information Processing Letters 74(3-4), 115–121 (2000)
Kowaluk, M., Lingas, A., Lundell, E.M.: Counting and detecting small subgraphs via equations and matrix multiplication. SIAM J. Discrete Math. 27(2), 892–909 (2013)
Koutis, I., Williams, R.: Limits and Applications of Group Algebras for Parameterized Problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 653–664. Springer, Heidelberg (2009)
Le Gall, F.: Faster Algorithms for Rectangular Matrix Multiplication. In: Proc. of FOCS, pp. 514–523 (2012)
Nešetřil, J., Poljak, S.: On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae 26(2), 415–419 (1985)
Olariu, S.: Paw-Free Graphs. Information Processing Letters 28, 53–54 (1988)
Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 606–609. Springer, Heidelberg (2005)
Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27, 701–717 (1980)
Vassilevska Williams, V.: Multiplying matrices faster than coppersmith-winograd. In: Proc. of STOC, pp. 887–898 (2012)
Vassilevska, V.: Efficient Algorithms for Path Problems in Weighted Graphs, PhD thesis, CMU, CMU-CS-08-147 (2008)
Vassilevska, V., Williams, R.: Finding, Minimizing, and Counting Weighted Subgraphs. In: Proc. of STOC 2009, pp. 455–464 (2009)
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
Floderus, P., Kowaluk, M., Lingas, A., Lundell, EM. (2013). Detecting and Counting Small Pattern Graphs. In: Cai, L., Cheng, SW., Lam, TW. (eds) Algorithms and Computation. ISAAC 2013. Lecture Notes in Computer Science, vol 8283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45030-3_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-45030-3_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45029-7
Online ISBN: 978-3-642-45030-3
eBook Packages: Computer ScienceComputer Science (R0)