Fast, effective vertex cover kernelization: A tale of two algorithms

3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005

Volumn 2005, Issue , 2005, Pages 33-39

  Abu Khzam, Faisal N ^a   Langston, Michael A ^b   Suters, W Henry ^b  

^a LEBANESE AMERICAN UNIVERSITY   (Lebanon)

^b University of Tennessee   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

CROWN REDUCTION; CROWN-FREE SUBGRAPH; LP-KERNELIZATION; VERTEX COVER KERNELIZATION;

GRAPH THEORY;

EID: 33746504540     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AICCSA.2005.1387015     Document Type: Conference Paper

References (14)

1. F. N. Abu-Khzam, R. L. Collins, M. R. Fellows, M. A. Langstom, W. H. Suters, and C. T. Symons. Kernelization algorithms for the vertex cover problem: Theory and experiments. In Proceedings, Workshop on Algorithm Engineering and Experiments (ALENEX), 2004.
2. F. N. Abu-Khzam, M. A. Langston, P. Shanbhag, and C. T. Symons. Scalable parallel algorithms for FPT problems. Technical Report UT-CS-04-524, Department of Computer Science, University of Tennessee, 2004.
3. D. Bienstock and M. A. Langston. Algorithmic implications of the graph minor theorem. In Handbook of Operations Research and Management Science: Network Models, pages 481-502. North-Holland, 1995.
4. J. F. Buss and J. Goldsmith. Nondeterminism within P. SIAM Journal on Computing, 22:560-572, 1993.
5. J. Chen, I. Kanj, and W. Jia. Vertex cover: further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
6. 2) steps. In Proceedings, International Workshop on Graph Theoretic Concepts in Computer Science, 2004.
7. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
8. M. R. Fellows, personal correspondence.
9. M. R. Fellows. Blow-ups, win/wins, and crown rules: Some new directions in FPT. Lecture Notes in Computer Science, 2880:1-12, 2003.
10. M. R. Fellows and M. A. Langston. Nonconstructive tools for proving polynomial-time decidability. Journal of the ACM, 35:727-739, 1988.
11. S. Khuller. The vertex cover problem. ACM SIGACT News, 33:31-33, June 2002.
12. G.L. Nemhauser and L. E. Trotter. Vertex packings: Structural properties and algorithms. Mathematical Programming, 8:232-248, 1975.
13. N. Robertson and P. D. Seymour. Graph minors XXIII, the disjoint paths problem. Journal of Combinatorial Theory, Series B, pages 65-110, 1995.
14. W. H. Suters. Crown decomposition: Theoretical results and practical methods. Master's thesis, Department of Computer Science, University of Tennessee, 2004.