Abstract
We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H=K 3 (the triangle) we give an O(22klog k + 1.869k n 2) algorithm, and for general H an O(2k|H|logk + 2k|H|log |H| n |H|) algorithm. We introduce a preprocessing (kernelization) technique based on crown decompositions of an auxiliary graph. For H=K 3 this leads to a preprocessing algorithm that reduces an arbitrary input graph of the problem to a graph on O(k 3) vertices in polynomial time.
This work was initiated while the first and third authors were visiting the University of Bergen.
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
AbuKhzam, F., Suters, H.: Computer Science Department, University of Tennessee, Knoxville, private communications (December 2003)
Alon, N., Yuster, R., Zwick, U.: Color-Coding. J. ACM, 844–856 (1995)
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)
Chor, B., Fellows, M., Juedes, D.: Saving k Colors in Time O(n 5/2). Manuscript (2003)
Chor, B., Fellows, M., Juedes, D.W.: Linear kernels in linear time, or how to save k colors in o(n 2) steps. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 257–269. Springer, Heidelberg (2004)
Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences 67 (2003)
Downey, R., Estivill-Castro, V., Fellows, M., Prieto-Rodriguez, E., Rosamond, F.: Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Electronic Notes in Theoretical Computer Science vol. 78, pp. 205–218 (2003)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
Downey, R., Fellows, M., Stege, U.: Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability. In: Graham, R., Kratochvil, J., Nesetril, J., Roberts, F. (eds.) Contemporary Trends in Discrete Mathematics, AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, pp. 49–99 (1999)
Edmonds, J.: Paths, trees and flowers. Can. J. Math. 17(3), 449–467 (1965)
Fellows, M.R.: Blow-ups, win/Win’s, and crown rules: Some new directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 1–12. Springer, Heidelberg (2003)
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)
Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Disc. Math. 2, 68–72 (1989)
Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-set packing. Journal of Algorithms 50(1), 106–117 (2004.r)
Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Inform. Process. Lett. 37, 27–35 (1991)
Woeginger, G.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)
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
Fellows, M., Heggernes, P., Rosamond, F., Sloper, C., Telle, J.A. (2004). Finding k Disjoint Triangles in an Arbitrary Graph. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2004. Lecture Notes in Computer Science, vol 3353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30559-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-30559-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24132-4
Online ISBN: 978-3-540-30559-0
eBook Packages: Computer ScienceComputer Science (R0)