Abstract
Finding subgraphs with arbitrary overlap was introduced as the k-H-Packing with t-Overlap problem in [10]. Specifically, does a given graph G have at least k induced subgraphs each isomorphic to a graph H such that any pair of subgraphs share at most t vertices? This problem has applications in the discovering of overlapping communities in real networks. In this work, we introduce the first parameterized algorithm for the k-H-Packing with t-Overlap problem when H is an arbitrary graph of size r. Our algorithm combines a bounded search tree with a greedy localization technique and runs in time O(r rk k (r − t − 1)k + 2 n r), where n = |V(G)|, r = |V(H)|, and t < r. Applying similar ideas we also obtain an algorithm for packing sets with possible overlap which is a version of the k-Set Packing problem.
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
Adamcsek, B., Palla, G., Farkas, I., Derenyi, I., Vicsek, T.: Cfinder: locating cliques and overlapping modules in biological networks. Bioinformatics 22(8), 1021–1023 (2006)
Damaschke, P.: Fixed-parameter tractable generalizations of cluster editing. In: The 6th International Conference on Algorithms and Complexity (CIAC), pp. 344–355 (January 2006)
Fellows, M., Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Graph-based data clustering with overlaps. Discrete Optimization 8(1), 2–17 (2011)
Fellows, M., Heggernes, P., Rosamond, F., Sloper, C., Telle, J.: Finding k disjoint triangles in an arbitrary graph. In: The 30th Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp. 235–244 (2004)
Fellows, M., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica 52(2), 167–176 (2008)
Hartung, S., Komusiewicz, C., Nichterlein, A.: On structural parameterizations for the 2-club problem. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 233–243. Springer, Heidelberg (2013)
Komusiewicz, C., Sorge, M.: Finding dense subgraphs of sparse graphs. In: 7th International Symposium on Parameterized and Exact Computation (IPEC), pp. 242–251 (2012)
Moser, H.: A problem kernelization for graph packing. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 401–412. Springer, Heidelberg (2009)
Prieto, E., Sloper, C.: Looking at the stars. Theoretical Computer Science 351(3), 437–445 (2006)
Romero, J., López-Ortiz, A.: The \({\mathcal{G}}\)-packing with t-overlap problem. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol. 8344, pp. 114–124. Springer, Heidelberg (2014)
Schäfer, A., Komusiewicz, C., Moser, H., Niedermeier, R.: Parameterized computational complexity of finding small-diameter subgraphs. Optimization Letters 6(5), 883–891 (2012)
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
Romero, J., López-Ortiz, A. (2014). A Parameterized Algorithm for Packing Overlapping Subgraphs. In: Hirsch, E.A., Kuznetsov, S.O., Pin, JÉ., Vereshchagin, N.K. (eds) Computer Science - Theory and Applications. CSR 2014. Lecture Notes in Computer Science, vol 8476. Springer, Cham. https://doi.org/10.1007/978-3-319-06686-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-06686-8_25
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06685-1
Online ISBN: 978-3-319-06686-8
eBook Packages: Computer ScienceComputer Science (R0)