Fixed-parameter tractability of graph modification problems for hereditary properties

Information Processing Letters

Volumn 58, Issue 4, 1996, Pages 171-176

  Cai, Leizhen ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Design of algorithms; Fixed parameter tractability; Graph algorithms; Graph modification problems

Indexed keywords

EID: 0000971678     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00050-6     Document Type: Article

References (16)

1. L.W. Beineke, On derived graphs and digraphs, in: H. Sachs, H.J. Voss and H. Walther, eds., Beiträge zur Graphentheorie (Teubner, Leipzig, 1968) 17-33.
2. T.H. Cormer, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, MA, 1990).
3. D.G. Corneil, H. Lerchs and L.S. Burlingham, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163-174.
4. R.G. Downey and M.R. Fellows, Parameterized complexity, Monograph in preparation.
5. R.G. Downey and M.R. Fellows, Fixed-parameter intractability, in: Proc. 7th Structure in Complexity Theory Conf. (1992) 36-49.
6. R.G. Downey and M.R. Fellows, Fixed parameter tractability and completeness, in: Complexity Theory: Current Research (Cambridge University Press, 1993) 36-49.
7. S. Födes and P.L. Hammer, Split graphs, in: Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Baton Rouge, LA (1977) 36-49.
8. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, San Francisco, 1979).
9. H. Kaplan, R. Shamir and R.E. Tarjan, Tractability of parameterized completion problems on chordal and interval graphs: Minimum fill-in and physical mapping (extended abstract), in: Proc. 35th Ann. Symp. on Foundations of Computer Science, Santa Fe, NM (1994) 36-49.
10. M.S. Krishnamoorthy and D. Narsingh, Node-deletion NP-complete problems, SIAM J. Comput. 8 (1979) 619-625.
11. J.M. Lewis, On the complexity of the maximum subgraph problem, in: Proc. 10th ACM Symp. on Theory of Computing, New York (1978) 265-274.
12. D. Rose, R. Tarjan and G. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput. 5 (1976) 266-283.
13. F. Ruskey and A. Proskurowski, Generating binary trees by transpositions, J. Algorithms 11 (1990) 266-283.
14. R. Tarjan and M. Yannakakis, Addendum: Simple linear-time algorithms to test chordality of graphs, text acyclicity of hypergraphs and selectively reduce acyclic hypergraphs, SIAM J. Comput. 14 (1985) 254-255.
15. M. Yannakakis, Node- and edge-deletion NP-complete problems, in: Proc. 10th ACM Symp. on Theory of Computing, New York (1978) 253-264.
16. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Algebraic Discrete Methods 2 (1981) 77-79.