Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties
暂无分享,去创建一个
[1] John M. Lewis. On the complexity of the Maximum Subgraph Problem , 1978, STOC '78.
[2] G DowneyRod,et al. Fixed-Parameter Tractability and Completeness I , 1995 .
[3] Michael R. Fellows,et al. Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.
[4] Michael R. Fellows,et al. Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.
[5] Uwe Schöning,et al. Complexity theory: current research , 1993 .
[6] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[7] Mihalis Yannakakis,et al. Node-and edge-deletion NP-complete problems , 1978, STOC.
[8] Derek G. Corneil,et al. Complement reducible graphs , 1981, Discret. Appl. Math..
[9] M. Yannakakis. Computing the Minimum Fill-in is NP^Complete , 1981 .
[10] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Haim Kaplan,et al. Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[13] Frank Ruskey,et al. Generating Binary Trees by Transpositions , 1988, J. Algorithms.
[14] Narsingh Deo,et al. Node-Deletion NP-Complete Problems , 1979, SIAM J. Comput..