Chordal deletion is fixed-parameter tractable

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

Volumn 4271 LNCS, Issue , 2006, Pages 37-48

  Marx, Dániel ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; NUMBER THEORY; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

CHORDAL DELETION; POLYNOMIAL TIME ALGORITHMS;

GRAPH THEORY;

EID: 33845540494     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11917496_4     Document Type: Conference Paper

References (10)

1. L. Cai. Fixed-parameter tractability of graph modification problems for hereditary properties. Inform. Process. Lett., 58(4):171-176, 1996.
2. L. Cai. Parameterized complexity of vertex colouring. Discrete Appl. Math., 127:415-429, 2003.
3. R. G. Downey and M. R. Fellows. Parameterized complexity. Springer, 1999.
4. M. C. Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, New York, 1980.
5. H. Kaplan, R. Shamir, and R. E. Tarjan. Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Comput., 28(5):1906-1922, 1999.
6. J. M. Lewis and M. Yannakakis. The node-deletion problem for hereditary properties is NP-complete. J. Comput. System Sci., 20(2):219-230, 1980.
7. A. Natanzon, R. Shamir, and R. Sharan. Complexity classification of some edge modification problems. Discrete Appl. Math., 113(1):109-128, 2001.
8. B. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Operations Research Letters, 32(4):299-301, 2004.
9. D. J. Rose, R. E. Tarjan, and G. S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput., 5(2):266-283, 1976.
10. M. Yannakakis. Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discrete Methods, 2(1):77-79, 1981.