Parameterized Graph Editing with Chosen Vertex Degrees
暂无分享,去创建一个
[1] Hannes Moser,et al. Parameterized complexity of finding regular induced subgraphs , 2009, J. Discrete Algorithms.
[2] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[3] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[4] Dror Rawitz,et al. Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property , 2002, J. Algorithms.
[5] Leizhen Cai,et al. Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..
[6] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[7] Michael R. Fellows,et al. FPT is P-Time Extremal Structure I , 2005, ACiD.
[8] Iain A. Stewart. On locating cubic subgraphs in bounded-degree connected bipartite graphs , 1997, Discret. Math..
[9] Ján Plesník,et al. A note on the complexity of finding regular subgraphs , 1984, Discret. Math..
[10] Iain A. Stewart. Finding Regular Subgraphs in Both Arbitrary and Planar Graphs , 1996, Discret. Appl. Math..
[11] Iain A. Stewart. Deciding whether a planar graph has a cubic subgraph is NP-complete , 1994, Discret. Math..
[12] Jan van Leeuwen,et al. Finding a bigtriangleup-regular supergraph of minimum order , 2003, Discret. Appl. Math..
[13] Iain A. Stewart. On the fixed-parameter tractability of parameterized model-checking problems , 2008, Inf. Process. Lett..
[14] Michael A. Langston,et al. Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings , 2006, IWPEC.
[15] Yun Zhang,et al. The Cluster Editing Problem: Implementations and Experiments , 2006, IWPEC.
[16] Oscar Moreno,et al. Three-regular Subgraphs of Four-regular Graphs' , 1998, Eur. J. Comb..
[17] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[18] Martin Grohe,et al. Deciding first-order properties of locally tree-decomposable structures , 2000, JACM.
[19] Edith Elkind,et al. True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs , 2005, EC '05.
[20] Dimitrios M. Thilikos,et al. Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..
[21] Derek G. Corneil,et al. The complexity of regular subgraph recognition , 1990, Discret. Appl. Math..
[22] Stefan Szeider,et al. The Parameterized Complexity of Regular Subgraph Problems and Generalizations , 2008, CATS.