Finding k disjoint triangles in an arbitrary graph

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

Volumn 3353, Issue , 2004, Pages 235-244

  Fellows, Mike ^a   Heggernes, Pinar ^b   Rosamond, Frances ^b   Sloper, Christian ^a   Telle, Jan Arne ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; POLYNOMIAL APPROXIMATION; COMPUTATIONAL COMPLEXITY;

ARBITRARY GRAPHS; ARBITRARY INPUTS; AUXILIARY GRAPH; FIXED GRAPHS; H-ALGORITHM; INPUT GRAPHS; KERNELIZATION; POLYNOMIAL-TIME; PRE-PROCESSING ALGORITHMS; VERTEX DISJOINT;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY;

EID: 33750267935     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30559-0_20     Document Type: Article

References (16)

1. F. AbuKhzam and H. Suters, Computer Science Department, University of Tennessee, Knoxville, private communications, Dec. 2003.
2. N. Alon, R. Yuster, U. Zwick. Color-Coding. J. ACM, 844-856, 1995
3. F. Abu-Khzam, R. Collins, M. Fellows and M. Langsten. Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. Proceedings ALENEX 2004, Springer-Verlag, Lecture Notes in Computer Science (2004), to appear.
4. 5/2). Manuscript, 2003.
5. 2) steps. Proceedings of WG2004, Springer-Verlag, Lecture Notes in Computer Science (2004)
6. L. Cai and D. Juedes. On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences 67 (2003).
7. R. Downey, V. Estivill-Castro, M. Fellows, E. Prieto-Rodriguez and F. Rosamond. Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Electronic Notes in Theoretical Computer Science 78 (2003), 205-218.
8. R. Downey and M. Fellows. Parameterized Complexity Springer-Verlag (1999).
9. R. Downey, M. Fellows and U. Stege, Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability, in: Contemporary Trends in Discrete Mathematics, (R. Graham, J. Kratochvil, J. Nesetril and F. Roberts, eds.), AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science 49, 49-99, 1999.
10. J.Edmonds. Paths, trees and flowers, Can.J.Math., 17, 3, pages 449-467, 1965.
11. M. Fellows. Blow-ups, Win/Wins and Crown Rules: Some New Directions in FPT. Proceedings WG 2003, Springer Verlag LNCS 2880, pages 1-12, 2003.
12. P. Hell and D. Kirkpatrick. On the complexity of a generalized matching problem. Proceedings of 10th ACM Symposium on theory of computing, 309-318, 1978.
13. 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. Disc. Math. 2, 68-72, 1989.
14. W. Jia, C. Zhang and J. Chen. An efficient parameterized algorithm for m-set packing, Journal of Algorithms, 50(1):106-117, 2004.r.
15. V. Kann. Maximum bounded 3-dimensional matching is MAX S W-complete, Inform. Process. Lett. 37, 27-35, 1991.
16. G. Woeginger. Exact algorithms for ATP-hard problems: A survey, Combinatorial Optimization - Eureka! You shrink!, M. Juenger, G. Reinelt and G. Rinaldi (eds.). LNCS 2570, Springer, 185-207, 2003.