Abstract
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of applications in many areas, especially computational biology [BP96]. In this paper we present an analysis of the problem from a parameterized complexity viewpoint. We describe a fixed-parameter tractable algorithm for the problem by means of kernelization and crown rule reductions, two of the newest techniques for fixed-parameter algorithm design. We achieve a kernel size bounded by 4k, where k is the number of triangles in the packing.
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-Khazam, F., Langston, M., Shanbhag, P., Symons, C.: High-Performance Tools for Fixed-Parameter Tractable Implementations. In: 29th Workshop on Graph Theoretic Concepts in Computer Science, Workshop on Fixed Parameter Tractability (2003)
Alon, N., Yuster, R., Zwick, U.: Color-Coding. Journal of the ACM 42(4), 844–856 (1995)
Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM 41(1) (1994)
Bafna, V., Pevzner, P.: Genome Rearrangements and Sorting by Reversals. SIAM J. Comput. 25(2) (1996)
Cai, L., Chen, J., Downey, R., Fellows, M.: Advice Classes of Parameterized Tractability. Annals of Pure and Applied Logic 84, 119–138 (1997)
Chor, B., Fellows, M., Juedes, D.: Saving k Colors in Time O(n5/2) (manuscript in preparation)
Caprara, A., Rizzi, R.: Packing Triangles in Bounded Degree Graphs. Inf. Process. Lett. 84(4), 175–180 (2002)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
Dehne, F., Fellows, M., Fernau, H., Prieto, E., Rosamond, F.: A Description of the Method of Coordinatized Kernels Illustrated by Nonblocker (manuscript in preparation)
Dehne, F., Fellows, M., Rosamond, F.: An FPT Algorithm for Set Splitting. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 180–191. Springer, Heidelberg (2003)
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/Wins and Crown Rules: Some New Directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 1–12. Springer, Heidelberg (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., Knauer, C., Nishimura, N., Radge, P., Rosamond, F., Stege, U., Thilikos, D., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 311–322. Springer, Heidelberg (2004)
Fellows, M., Fernau, H., Langston, M., Prieto, E., Shaw, P., Symons, C., Stege, U.: The Graph Modification Problem: Edge Editing to k Cliques (manuscript in preparation)
Fellows, M., 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)
Fellows, M., Prieto, E., Sloper, C.: Looking at the Stars (manuscript in preparation)
Holyer, I.: The NP-completeness of some edge-partition problems. SIAM J. Comput. 10, 713–717 (1981)
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. Discret. Math. 2(1), 68–72 (1989)
Kann, V.: Maximum bounded H-matching is MAX-SNP-complete. Information Processing Letters 49, 309–318 (1994)
Prieto, E., Sloper, C.: Either/Or: Using Vertex Cover Structure in designing FPT-algorithms - the case of k-Internal Spanning Tree. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 474–483. 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
Mathieson, L., Prieto, E., Shaw, P. (2004). Packing Edge Disjoint Triangles: A Parameterized View. 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_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-28639-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23071-7
Online ISBN: 978-3-540-28639-4
eBook Packages: Springer Book Archive