Reconfiguration of list L(2,1)-labelings in a graph

For an integer k>=0, suppose that each vertex v of a graph G has a set C(v)@?{0,1,...,k} of labels, called a list of v. A list L(2,1)-labeling of G is an assignment of a label in C(v) to each vertex v of G such that every two adjacent vertices receive labels which differ by at least 2 and every two vertices of distance two receive labels which differ by at least 1. In this paper, we study the problem of reconfiguring one list L(2,1)-labeling of a graph into another list L(2,1)-labeling of the same graph by changing only one label assignment at a time, while at all times maintaining a list L(2,1)-labeling. First we show that this decision problem is PSPACE-complete, even for bipartite planar graphs and k>=6. In contrast, we then show that the problem can be solved in linear time for general graphs if k@?4. We finally consider the problem restricted to trees, and give a sufficient condition for which any two list L(2,1)-labelings of a tree can be transformed into each other.

[1]  Alexander Schrijver Bipartite Edge Coloring in O(Delta m) Time , 1998, SIAM J. Comput..

[2]  Erik D. Demaine,et al.  Games, puzzles and computation , 2009 .

[3]  Marthe Bonamy,et al.  Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs , 2014, J. Comb. Optim..

[4]  Zsolt Tuza,et al.  List version of L(d, s)-labelings , 2005, Theor. Comput. Sci..

[5]  Takehiro Ito,et al.  Reconfiguration of List L(2, 1)-Labelings in a Graph , 2012, ISAAC.

[6]  Fumiyuki Adachi,et al.  Channel segregation based dynamic channel assignment for WLAN , 2012, 2012 IEEE International Conference on Communication Systems (ICCS).

[7]  Takehiro Ito,et al.  An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree , 2011, TAMC.

[8]  Tiziana Calamoneri,et al.  The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography , 2011, Comput. J..

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

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

[11]  Kazuhisa Makino,et al.  An exact algorithm for the Boolean connectivity problem for k-CNF , 2011, Theor. Comput. Sci..

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

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

[14]  Martin Milanic,et al.  Shortest paths between shortest paths , 2011, Theor. Comput. Sci..

[15]  Lazaros F. Merakos,et al.  A centralized approach to dynamic channel assignment in wireless ATM LANs , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[17]  Hirotaka Ono,et al.  A Linear Time Algorithm for L(2,1)-Labeling of Trees , 2012, Algorithmica.

[18]  Takehiro Ito,et al.  Approximability of the subset sum reconfiguration problem , 2011, J. Comb. Optim..

[19]  Jan van den Heuvel,et al.  Finding paths between 3‐colorings , 2011, IWOCA.

[20]  Marthe Bonamy,et al.  On the diameter of reconfiguration graphs for vertex colourings , 2011, Electron. Notes Discret. Math..

[21]  Paul S. Bonsma,et al.  Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances , 2007, Theor. Comput. Sci..