A Parameterized Algorithm for Packing Overlapping Subgraphs
Finding subgraphs with arbitrary overlap was introduced as the k-H-Packing with t-Overlap problem in . 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.
KeywordsGreedy Algorithm Search Tree Parameterized Algorithm Maximal Solution Feasible Path
Unable to display preview. Download preview PDF.
- 2.Damaschke, P.: Fixed-parameter tractable generalizations of cluster editing. In: The 6th International Conference on Algorithms and Complexity (CIAC), pp. 344–355 (January 2006)Google Scholar
- 4.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)Google Scholar
- 7.Komusiewicz, C., Sorge, M.: Finding dense subgraphs of sparse graphs. In: 7th International Symposium on Parameterized and Exact Computation (IPEC), pp. 242–251 (2012)Google Scholar