Looking at the stars

Theoretical Computer Science

Volumn 351, Issue 3, 2006, Pages 437-445

  Prieto, Elena ^a   Sloper, Christian ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Crown reduction; Fixed parameter algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; PROBLEM SOLVING;

CROWN REDUCTION; FIXED PARAMETER ALGORITHMS; PARAMETERIZED COMPLEXITY;

GRAPH THEORY;

EID: 32144449294     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.10.009     Document Type: Conference Paper

References (17)

1. F.N. Abu-Khzam, R.L. Collins, M.R. Fellows, M. Langston, W.H. Suters, C.T. Symons, Kernelization algorithms for the vertex cover problem: theory and experiments. ALENEX/ANALC 2004, pp. 62-69.
2. N. Alon, R. Yuster, and U. Zwick Color-coding J. ACM 42 4 1995 844 856
3. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi Complexity and Approximation 1999 Springer Berlin
4. R. Bar-Yehuda, M. Halldórsson, J. Naor, H. Shachnai, and I. Shapira Scheduling split intervals Proc. Thirteenth Annu. ACM-SIAM Symp. on Discrete Algorithms 2002 732 741
5. R. Bejar, B. Krishnamachari, C. Gomes, B. Selman, Distributed constraint satisfaction in a wireless sensor tracking system, Workshop on Distributed Constraint Reasoning, Internat. Joint Conf. on Artificial Intelligence, 2001.
6. B. Chor, M. Fellows, D. Juedes, An efficient FPT algorithm for saving k colors, Manuscript, 2003.
7. 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, Vol. 49, 1999, pp. 49-99.
8. M. Fellows, Blow-ups, win/win's, and crown rules: some new directions in FPT, Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 2880, Springer, Berlin, 2003, pp. 1-12.
9. M. Fellows, P. Heggernes, F. Rosamond, C. Sloper, J.A. Telle, Exact algorithms for finding k disjoint triangles in an arbitrary graph, in: Proc. 30th Workshop on Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 3353, Springer, Berlin, 2004, pp. 235-244.
10. M.R. Fellows, C. McCartin, F. Rosamond, 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, Lecture Notes in Computer Science, Vol. 1974, Springer, Berlin, 2000, p. 240.
11. P. Hell, and D. Kirkpatrick On the complexity of a generalized matching problem Proc. Tenth ACM Symp. on Theory of Computing 1978 309 318
12. P. Hell, and D. Kirkpatrick Packings by complete bipartite graphs SIAM J. Algebraic Discrete Methods 7 1986 199 209
13. J. Hopcroft, and R. Karp An n5/2 algorithm for maximum matchings in bipartite graphs SIAM J. Comput. 2 1973 225 231
14. C. Hurkens, and A. Schrijver 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 SIAM J. Discrete Math. 2 1989 68 72
15. V. Kann Maximum bounded H-matching is MAX-SNP-complete Inform. Process. Lett. 49 1994 309 318
16. E. Prieto, C. Sloper, Reducing to Independent Set Structure - the case of k - Internal Spanning Tree. Nordic Journal of Computing, to appear.
17. N. Robertson, P.D. Seymour, Graph minors XX. Wagner's conjecture, in review.