Packing edge disjoint triangles: A parameterized view

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3162, Issue , 2004, Pages 127-137

  Mathieson, Luke ^a   Prieto, Elena ^a   Shaw, Peter ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; PARAMETERIZATION;

COMPUTATIONAL BIOLOGY; FIXED-PARAMETER ALGORITHMS; FIXED-PARAMETER TRACTABLE ALGORITHMS; KERNELIZATION; NUMBER OF TRIANGLES; PARAMETERIZED; PARAMETERIZED COMPLEXITY; RULE REDUCTION;

PARAMETER ESTIMATION;

EID: 33750266499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28639-4_12     Document Type: Article

References (21)

1. [ALSS03] F. Abu-Khazam, M. Längsten, P. Shanbhag, C. Symons. High-Performance Tools for Fixed-Parameter Tractable Implementations, 29th Workshop on Graph Theoretic Concepts in Computer Science, Workshop on Fixed Parameter Tractability (2003).
2. [AYZ95] N. Alon, R. Yuster, U. Zwick. Color-Coding, Journal of the ACM, Volume 42(4), pages 844-856 (1995).
3. [B94] B. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, Volume 41(1) (1994).
4. [BP96] V. Bafna and P. Pevzner, Genome Rearrangements and Sorting by Reversals, SIAM J. Comput. 25(2) (1996).
5. [CCDF97] L. Cai, J. Chen, R. Downey and M. Fellows. Advice Classes of Parameterized Tractability. Annals of Pure and Applied Logic 84, pages 119-138 (1997).
6. 5/2). Manuscript in preparation.
7. [CR01] A. Caprara, R. Rizzi. Packing Triangles in Bounded Degree Graphs. Inf. Process. Lett. 84(4), pages 175-180 (2002).
8. [DF99] R. Downey and M. Fellows. Parameterized Complexity Springer-Verlag (1999).
9. [DFFPR03] F. Dehne, M. Fellows, H. Fernau, E. Prieto, F.Rosamond A Description of the Method of Coordinatized Kernels Illustrated by NONBLOCKER. Manuscript in preparation.
10. [DFR03] F. Dehne, M. Fellows, F.Rosamond. An FPT Algorithm for Set Splitting. Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science, Springer Verlag LNCS 2880, (2003).
11. [DFS99] R. Downey, M. Fellows, U. Stege. Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability. AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 49, pages 49-99 (1999).
12. [F03] M. Fellows. Blow-ups, Win/Wins and Crown Rules: Some New Directions in FPT. Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science, Springer Verlag LNCS 2880, pages 1-12, (2003).
13. [FHRST04] M. Fellows, P. Heggernes, F. Rosamond, C. Sloper, J.A. Telle Exact Algorithms for Finding k Disjoint Triangles in an Arbitrary Graph. Proceedings 30th Workshop on Graph Theoretic Concepts in Computer Science (WG '04), Springer Verlag LNCS, (2004).
14. [FK+04] M. Fellows, C. Knauer, N. Nishimura, P. Radge, F. Rosamond, U. Stege, D. Thilikos, S. Whitesides. Faster fixed-parameter tractable algorithms for matching and packing problems. Accepted in 12th Annual European Symposium on Algorithms (ESA '04), Springer Verlag LNCS, (2004).
15. [FL03] M. Fellows, H. Fernau, M. Langston, E. Prieto, P. Shaw, C. Symons, U. Stege. The Graph Modification Problem: Edge Editing to k Cliques. Manuscript in preparation.
16. [FMRS00] M. Fellows, C. McCartin, F. Rosamond, and U.Stege. 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).
17. [FPS03] M. Fellows, E. Prieto, C. Sloper. Looking at the Stars. Manuscript in preparation.
18. [HOL81] I. Holyer, The NP-completeness of some edge-partition problems, SIAM J. Comput. 10, pages 713-717 (1981).
19. [HS89] C. A. J. Hurkens and A, Schrijver. 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), pages 68-72 (1989).
20. [K94] V. Kann. Maximum bounded H-matching is MAX-SNP-complete. Information Processing Letters 49, pages 309-318 (1994).
21. [PS03] E. Prieto and C. Sloper. Either/Or: Using Vertex Cover Structure in designing FPT-algorithms - the case of k-Internal Spanning Tree, Proceedings of WADS. Workshop on Algorithms and Data Structures, Ottawa, Canada, LNCS 2748 pages 474-483 (2003).