Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints

We investigate the complexity of finding a transformation from a given spanning tree in a graph to another given spanning tree in the same graph via a sequence of edge flips. The exchange property of the matroid bases immediately yields that such a transformation always exists if we have no constraints on spanning trees. In this paper, we wish to find a transformation which passes through only spanning trees satisfying some constraint. Our focus is bounding either the maximum degree or the diameter of spanning trees, and we give the following results. The problem with a lower bound on maximum degree is solvable in polynomial time, while the problem with an upper bound on maximum degree is PSPACE-complete. The problem with a lower bound on diameter is NP-hard, while the problem with an upper bound on diameter is solvable in polynomial time. 2012 ACM Subject Classification Mathematics of computing → Graph algorithms

[1]  Mohit Singh,et al.  Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal , 2015, J. ACM.

[2]  Erin W. Chambers,et al.  Multiple-Source Shortest Paths in Embedded Graphs , 2012, SIAM J. Comput..

[3]  Ada Wai-Chee Fu,et al.  Minimum Spanning Trees in Temporal Graphs , 2015, SIGMOD Conference.

[4]  Universitat-Gesamthochschule Paderborn.  BOUNDED DEGREE SPANNING TREES , 1997 .

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

[6]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

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

[8]  Jan van den Heuvel,et al.  The complexity of change , 2013, Surveys in Combinatorics.

[9]  Naomi Nishimura,et al.  Introduction to Reconfiguration , 2018, Algorithms.

[10]  Serge Chaumette,et al.  Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case , 2014, OPODIS.

[11]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[12]  Refael Hassin,et al.  On the Minimum Diameter Spanning Tree Problem , 1995, Inf. Process. Lett..

[13]  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..

[14]  Refael Hassin,et al.  Minimum Restricted Diameter Spanning Trees , 2002, APPROX.

[15]  Giuseppe F. Italiano,et al.  Maintaining Spanning Trees of Small Diameter , 1998, Algorithmica.

[16]  Sergey Bereg,et al.  Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree , 2003, Algorithmica.

[17]  Takehiro Ito,et al.  Reconfiguration of Minimum Steiner Trees via Vertex Exchanges , 2019, MFCS.

[18]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[19]  Martin Fürer,et al.  Approximating the Minimum-Degree Steiner Tree to within One of Optimal , 1994, J. Algorithms.

[20]  Michel X. Goemans,et al.  Minimum Bounded Degree Spanning Trees , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[21]  Takehiro Ito,et al.  Reconfiguration of Spanning Trees with Many or Few Leaves , 2020, ESA.

[22]  Giuseppe F. Italiano,et al.  Maintaining Spanning Trees of Small Diameter , 1994, ICALP.

[23]  Asahi Takaoka,et al.  Complexity of Hamiltonian Cycle Reconfiguration , 2018, Algorithms.