Unit Interval Editing is Fixed-Parameter Tractable
暂无分享,去创建一个
[1] Fedor V. Fomin,et al. A Polynomial Kernel for Proper Interval Vertex Deletion , 2013, SIAM J. Discret. Math..
[2] John M. Lewis,et al. The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..
[3] Leizhen Cai,et al. Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..
[4] Haim Kaplan,et al. Four Strikes Against Physical Mapping of DNA , 1995, J. Comput. Biol..
[5] Christian Komusiewicz,et al. Measuring Indifference: Unit Interval Vertex Deletion , 2010, WG.
[6] Flavia Bonomo,et al. NP-completeness results for edge modification problems , 2006, Discret. Appl. Math..
[7] Dániel Marx. Chordal Deletion is Fixed-Parameter Tractable , 2008, Algorithmica.
[8] M. Yannakakis. Computing the Minimum Fill-in is NP^Complete , 1981 .
[9] Yunlong Liu,et al. Edge deletion problems: Branching facilitated by modular decomposition , 2015, Theor. Comput. Sci..
[10] Haim Kaplan,et al. Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs , 1999, SIAM J. Comput..
[11] Pim van 't Hof,et al. Proper Interval Vertex Deletion , 2012, Algorithmica.
[12] Jayme Luiz Szwarcfiter,et al. Normal Helly circular-arc graphs and its subclasses , 2013, Discret. Appl. Math..
[13] Yixin Cao,et al. Chordal Editing is Fixed-Parameter Tractable , 2014, Algorithmica.