Abstract
The problem of packing k vertex-disjoint copies of a graph H into another graph G is NP-complete if H has more than two vertices in some connected component. In the framework of parameterized complexity we analyze a particular family of instances of this problem, namely the packing of stars. We prove that packing k copies of H = K 1, s is fixed-parameter tractable and give a quadratic kernel for the general case. When we consider the special case of s=2, i.e. H being a star with two leaves, we give a linear kernel and an algorithm running in time \({\mathcal O}^*(2^{5.3k})\).
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
Abu-Khzam, F., Collins, R., Fellows, M., Langston, M.: Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. In: Proceedings ALENEX 2004. LNCS, Springer, Heidelberg (2004) (to appear)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)
Bar-Yehuda, R., Halldrsson, M., Naor, J., Shachnai, H., Shapira, I.: Scheduling Split Intervals. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 732–741 (2002)
Bejar, R., Krishnamachari, B., Gomes, C., Selman, B.: Distributed constraint satisfaction in a wireless sensor tracking system. In: Workshop on Distributed Constraint Reasoning, International Joint Conference on Artificial Intelligence (2001)
Chor, B., Fellows, M., Juedes, D.: An Efficient FPT Algorithm for Saving k colors (2003) (manuscript)
Downey, R., Fellows, M., Stege, U.: Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability. AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, pp. 49–99 (1999)
Fellows, M.: Blow-Ups, Win/Win’s, and Crown Rules: Some new Directions in FPT. In: Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science (2003)
Fellows, M., Heggernes, P., Rosamond, F., Sloper, C., Telle, J.A.: Exact algorithms for finding k disjoint triangles in an arbitrary graph. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 235–244. Springer, Heidelberg (2004)
Fellows, M.R., McCartin, C., Rosamond, F., Stege, U.: Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. Foundations of Software Technology and Theoretical Computer Science (2000)
Hopcroft, J., Karp, R.: An n 5=2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing 2, 225–231 (1973)
Hell, P., Kirkpatrick, D.: On the complexity of a generalized matching problem. In: Proceedings of 10th ACM Symposium on theory of computing, pp. 309–318 (1978)
Hell, P., Kirkpatrick, D.: Packings by complete bipartite graphs. SIAM Journal of Algebraic Discrete Methods 7, 199–209 (1986)
Hurkens, C., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with application to worst case ratio of Heuristics for packing problems. SIAMJournal of Discrete Mathematics 2, 68–72 (1989)
Kann, V.: Maximum bounded H-matching is MAX-SNP-complete. Information Processing Letters 49, 309–318 (1994)
Prieto, E., Sloper, C.: Creating Crown Structure — The case of Max Internal Spanning Tree (submitted)
Robertson, N., Seymour, P.D.: Graph Minors XX. Wagner’s conjecture (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prieto, E., Sloper, C. (2004). Looking at the Stars. In: Downey, R., Fellows, M., Dehne, F. (eds) Parameterized and Exact Computation. IWPEC 2004. Lecture Notes in Computer Science, vol 3162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28639-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-28639-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23071-7
Online ISBN: 978-3-540-28639-4
eBook Packages: Springer Book Archive