Local 7-coloring for planar subgraphs of unit disk graphs

We study the problem of computing locally a coloring of an arbitrary planar subgraph of a unit disk graph. Each vertex knows its coordinates in the plane and can communicate directly with all its neighbors within unit distance. Using this setting, first a simple algorithm is given whereby each vertex can compute its color in a 9-coloring of the planar graph using only information on the subgraph located within at most 9 hops away from it in the original unit disk graph. A more complicated algorithm is then presented whereby each vertex can compute its color in a 7-coloring of the planar graph using only information on the subgraph located within a constant number (201, to be exact) of hops away from it.

[1]  Amit P. Sheth,et al.  Semantic Web Services and Web Process Composition, First International Workshop, SWSWPC 2004, San Diego, CA, USA, July 6, 2004, Revised Selected Papers , 2005, SWSWPC.

[2]  Jorge Urrutia,et al.  Local solutions for global problems in wireless networks , 2007, J. Discrete Algorithms.

[3]  Alain Hertz,et al.  A survey of local search methods for graph coloring , 2004, Comput. Oper. Res..

[4]  Alan M. Frieze,et al.  The Cover Times of Random Walks on Hypergraphs , 2011, SIROCCO.

[5]  Sundar Vishwanathan,et al.  Locality based graph coloring , 1993, STOC.

[6]  Mehmet Hakan Karaata,et al.  A self-stabilizing algorithm for coloring planar graphs , 2005, Distributed Computing.

[7]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[8]  Robin Thomas,et al.  Efficiently four-coloring planar graphs , 1996, STOC '96.

[9]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[10]  Tomomi Matsui,et al.  Multicoloring unit disk graphs on triangular lattice points , 2005, SODA '05.

[11]  Peter Doerre.  Every planar graph is 4-colourable and 5-choosable - a joint proof , 2004 .

[12]  Tommy R. Jensen,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .

[13]  Zsolt Tuza,et al.  Graph colorings with local constraints - a survey , 1997, Discuss. Math. Graph Theory.

[14]  A. Gräf,et al.  On Coloring Unit Disk Graphs , 1998, Algorithmica.

[15]  Margit Voigt.  List colourings of planar graphs , 2006, Discret. Math..

[16]  Margit Voigt,et al.  A note on planar 5-list colouring: non-extendability at distance 4 , 2002, Discret. Math..

[17]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[18]  Srdjan Capkun,et al.  GPS-free Positioning in Mobile Ad Hoc Networks , 2004, Cluster Computing.

[19]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[20]  Ioannis Caragiannis,et al.  A tight bound for online colouring of disk graphs , 2007, Theor. Comput. Sci..

[21]  Jan Karel Lenstra,et al.  On local search for the generalized graph coloring problem , 2003, Oper. Res. Lett..

[22]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[23]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[24]  Ioannis Caragiannis,et al.  A Tight Bound for Online Coloring of Disk Graphs , 2005, SIROCCO.

[25]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 2001, Wirel. Networks.

[26]  Xiang-Yang Li,et al.  Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks , 2006, Mob. Networks Appl..

[27]  Carsten Thomassen,et al.  Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.

[28]  Jorge Urrutia,et al.  Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges , 2006, LATIN.