An improved fixed-parameter algorithm for vertex cover

Information Processing Letters

Volumn 65, Issue 3, 1998, Pages 163-168

  Balasubramanian, R ^a   Fellows, Michael R ^b   Raman, Venkatesh ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Algorithms; Fixed parameter tractability; Vertex cover

Indexed keywords

EID: 0002095408     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00213-5     Document Type: Article

References (7)

1. J.F. Buss, J. Goldsmith, Nondeterminism within P, SIAM J. Comput. 22 (1993) 560-572.
2. L. Cai, J. Chen, Fixed parameter tractability and approximability of NP-hard optimization problems, in: Proc. 2nd Israel Symp. on Theory and Computing Systems, 1993, pp. 118-126.
3. R.G. Downey, M.R. Fellows, Fixed parameter tractability and completeness I: Basic theory, SIAM J. Comput. 24 (1995) 873-921.
4. R.G. Downey, M.R. Fellows, Fixed parameter tractability and completeness II: Completeness for W [1], Theoret. Comput. Sci. 141 (1995) 109-131.
5. R.G. Downey, M.R. Fellows, Parametrized Computational feasibility, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics II, Birkhauser, Boston, MA, 1995. pp. 219-244.
6. K. Mehlhorn, Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, Springer, Berlin, 1984.
7. C.H. Papadimitriou, M, Yannakakis, On limited non-determinism and the complexity of the V-C dimension, J. Comput. System Sci. 53 (1996) 161-170.