Looking at the stars

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

Volumn 3162, Issue , 2004, Pages 138-148

  Prieto, Elena ^a   Sloper, Christian ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

STARS;

CONNECTED COMPONENT; GRAPH G; LINEAR KERNEL; NP COMPLETE; PARAMETERIZED COMPLEXITY; QUADRATIC KERNELS; RUNNING-IN; VERTEX DISJOINT;

GRAPH THEORY;

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

References (16)

1. [ACFL04] F. Abu-Khzam, R. Collins, M. Fellows and M. Langston. Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. Proceedings ALENEX 2004, Springer-Verlag, Lecture Notes in Computer Science (2004), to appear.
2. [AC99] G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi. Complexity and Approximation Springer Verlag (1999).
3. [BM02] R. Bar-Yehuda, M. Halldrsson, J. Naor, H. Shachnai, I. Shapira. Scheduling Split Intervals. Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 732-741 (2002).
4. [BK01] R. Bejar, B. Krishnamachari, C. Gomes, and B. Selman. Distributed constraint satisfaction in a wireless sensor tracking system. Workshop on Distributed Constraint Reasoning, International Joint Conference on Artificial Intelligence, 2001
5. [CFJ03] B. Chor, M. Fellows, D. Juedes. An Efficient FPT Algorithm for Saving k colors. Manuscript (2003).
6. [DFS00] 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).
7. [F03] M. Fellows. Blow-Ups, Win/Win's, and Crown Rules: Some new Directions in FPT. Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science (2003).
8. [FHRST04] M.Fellows, P.Heggernes, F.Rosamond, C. Sloper, J.A.Telle, Exact algorithms for finding k disjoint triangles in an arbitrary graph, To appear WG2004
9. [FM+00] M.R. 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).
10. [HK73] J. Hopcroft and R. Karp. An n 5=2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing, 2 pages 225-231 (1973).
11. [HK78] P. Hell and D. Kirkpatrick. On the complexity of a generalized matching problem. Proceedings of 10th ACM Symposium on theory of computing, pages 309-318 (1978).
12. [HK86] P. Hell and D. Kirkpatrick. Packings by complete bipartite graphs. SIAM Journal of Algebraic Discrete Methods, number 7, pages 199-209 (1986).
13. [HS89] 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 Journal of Discrete Mathematics, number 2, pages 68-72 (1989).
14. [K94] V. Kann. Maximum bounded H-matching is MAX-SNP-complete. Information Processing Letters, number 49, pages 309-318 (1994).
15. [PS04] E.Prieto, C. Sloper. Creating Crown Structure - The case of Max Internal Spanning Tree. Submitted
16. [RS99] N. Robertson, PD. Seymour. Graph Minors XX. Wagner's conjecture, to appear.