论文信息 - The Complexity of Induced Tree Reconfiguration Problems - 字舞流文

The Complexity of Induced Tree Reconfiguration Problems

Hiroki Arimura | Kunihiro Wasa | Katsuhisa Yamanaka

[1] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[2] Marcin Wrochna,et al. Reconfiguration in bounded bandwidth and tree-depth , 2014, J. Comput. Syst. Sci..

[3] Takehiro Ito,et al. On the complexity of reconfiguration problems , 2011, Theor. Comput. Sci..

[4] Naomi Nishimura,et al. Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas , 2015, ICALP.

[5] Takehiro Ito,et al. Reconfiguration of list edge-colorings in a graph , 2012, Discret. Appl. Math..

[6] Christos H. Papadimitriou,et al. The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies , 2006, SIAM J. Comput..

[7] Martin Milanic,et al. Complexity of independent set reconfigurability problems , 2012, Theor. Comput. Sci..

[8] Jan van den Heuvel,et al. Connectedness of the graph of vertex-colourings , 2008, Discret. Math..

[9] Naomi Nishimura,et al. On the Parameterized Complexity of Reconfiguration Problems , 2013, Algorithmica.

[10] Erik D. Demaine,et al. PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation , 2002, Theor. Comput. Sci..

[11] Takehiro Ito,et al. The complexity of dominating set reconfiguration , 2015, Theor. Comput. Sci..

[12] Takehiro Ito,et al. Approximability of the Subset Sum Reconfiguration Problem , 2011, TAMC.