Abstract
We examine the general problem of covering graphs by graphs: given a graph G, a collection \(\mathcal{P}\) of graphs each on at most p vertices, and an integer r, is there a collection \(\mathcal{C}\) of subgraphs of G, each belonging to \(\mathcal{P}\), such that the removal of the graphs in \(\mathcal{C}\) from G creates a graph none of whose components have more than r vertices? We can also require that the graphs in \(\mathcal{C}\) be disjoint (forming a “matching”). This framework generalizes vertex cover, edge dominating set, and minimal maximum matching. In this paper, we examine the parameterized complexity of the counting version of the above general problem. In particular, we show how to count the solutions of size at most k of the covering and matching problems in time O(n · r(pk+r)+2f(k,p,r)), where n is the number of vertices in G and f is a simple polynomial. In order to achieve the additive relation between the polynomial and the non-polynomial parts of the time complexity of our algorithms, we use the compactor technique, the counting analogue of kernelization for parameterized decision problems.
The two first authors were supported by the Natural Sciences and Engineering Research Council of Canada (NSERC). The third author was supported by the Spanish CICYT project TIN-2004-07925 (GRAMMARS).
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
Arvind, V., Raman, V.: Approximation algorithms for some parameterized counting problems. In: Electronic Colloquium on Computational Complexity (2002)
Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 1–12. Springer, Heidelberg (2004)
Díaz, J., Serna, M., Thilikos, D.M.: Fixed parameter algorithms for counting and deciding bounded restrictive list h-colorings. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 275–286. Springer, Heidelberg (2004)
Díaz, J., Serna, M., Thilikos, D.M.: Recent results on parameterized h-coloring. In: Nesetril, J., Winkler, P. (eds.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Morphisms and Statistical Physics, vol. 63, pp. 65–86. Amer. Math. Soc, Providence (2004)
Fernau, H.: On parameterized enumeration. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 564–573. Springer, Heidelberg (2002)
Flum, J., Grohe, M.: The parameterized complexity of counting problems. SIAM J. Comput. 33(4), 892–922 (2004) (electronic)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nishimura, N., Ragde, P., Thilikos, D.M. (2005). Parameterized Counting Algorithms for General Graph Covering Problems. In: Dehne, F., López-Ortiz, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2005. Lecture Notes in Computer Science, vol 3608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534273_10
Download citation
DOI: https://doi.org/10.1007/11534273_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28101-6
Online ISBN: 978-3-540-31711-1
eBook Packages: Computer ScienceComputer Science (R0)