Local 7-coloring for planar subgraphs of unit disk graphs

Theoretical Computer Science

Volumn 412, Issue 18, 2011, Pages 1696-1704

  Czyzowicz, J ^a   Dobrev, S ^b   Gonzlez Aguilar, H ^c   Kralovic, R ^d   Kranakis, E ^e   Opatrny, J ^f   Stacho, L ^g   Urrutia, J ^h  

^a UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^b INSTITUTE OF CHEMISTRY   (Slovakia)

^c CENTRO DE INVESTIGACIÓN EN MATEMÁTICAS   (Mexico)

^d Physics and Informatics   (Slovakia)

^e CARLETON UNIVERSITY   (Canada)

^f Dept of Electrical and Computer Engineering   (Canada)

^g SIMON FRASER UNIVERSITY   (Canada)

^h UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

Coloring; Location aware; Planar; Unit disk graph

Indexed keywords

LOCATION-AWARE; PLANAR; PLANAR GRAPH; PLANAR SUBGRAPHS; SIMPLE ALGORITHM; SUBGRAPHS; UNIT DISK GRAPH; UNIT DISK GRAPHS;

ALGORITHMS; COLORING; GRAPHIC METHODS; INFORMATION USE;

GRAPH THEORY;

EID: 79952441284     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.12.044     Document Type: Conference Paper

References (24)

1. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia Routing with guaranteed delivery in ad hoc wireless networks Wireless Networks 7 2001 609 616 (Pubitemid 33091058)
2. S. Capkun, M. Hamdi, and J.-P. Hubeaux GPS-free positioning in mobile ad hoc networks Cluster Computing 5 2002 157 167
3. I. Caragiannis, A.V. Fishkin, C. Kaklamanis, and E. Papaioannou A tight bound for online coloring of disk graphs A. Pelc, M. Raynal, SIROCCO 2005, Mont Saint-Michel, France, May 2426, 2005, Proceedings Lecture Notes in Computer Science vol. 3499 2005 Springer 78 88
4. E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, and J. Urrutia Local construction of planar spanners in unit disk graphs with irregular transmission ranges M.K.j. Correa, A. Hevia, Latin 06 Lecture Notes in Computer Science vol. 3387 2006 Springer Verlag 286 297 (Pubitemid 43986614)
5. P. Drre, Every planar graph is 4-colourable and 5-choosable a joint proof, Fachhochschule Südwestfalen, University of Applied Sciences, unpublished note.
6. K.R. Gabriel, and R.R. Sokal A new statistical approach to geographic variation analysis Systemic Zoology 18 1972 259 278
7. P. Galinier, and A. Hertz A survey of local search methods for graph coloring Computers & OR 33 2006 2547 2562 (Pubitemid 43098900)
8. S. Ghosh, and M. Karaata A self-stabilizing algorithm for coloring planar graphs Distributed Computing 7 1993 55 59
9. A. Grf, M. Stumpf, and G. Weißenfels On coloring unit disk graphs Algorithmica 20 3 1998 277 293 (Pubitemid 128664705)
10. T.R. Jensen, and B. Toft Graph Coloring Problems Wiley-Interscience Series in Discrete Mathematics and Optimization 1995 John Wiley & Sons
11. E. Kranakis, H. Singh, J. Urrutia, Compass routing on geometric networks, in: Proc. of 11th Canadian Conference on Computational Geometry, August 1999, pp. 5154.
12. N. Linial Locality in distributed graph algorithms SIAM Journal on Computing 21 1 1992 193 201
13. M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, and D.J. Rosenkrantz Simple heuristics for unit disk graphs Networks 25 1 1995 59 68
14. Y. Miyamoto, and T. Matsui Multicoloring unit disk graphs on triangular lattice points SODA 2005 SIAM 895 896 (Pubitemid 40851453)
15. D. Peleg Distributed Computing: A Locality-Sensitive Approach 2000 SIAM
16. N. Robertson, D.P. Sanders, P. Seymour, R. Thomas, Efficiently four-coloring planar graphs, in: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, May 1996, pp. 571575.
17. M. Szegedy, S. Vishwanathan, Locality based graph coloring, in: Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, May 1993, pp. 201207. (Pubitemid 23668778)
18. C. Thomassen Every planar graph is 5 -choosable Combinatorial Theory Series B 62 1 1994 180 181
19. Z. Tuza Graph colorings with local constraints: a survey Discussiones MathematicaeGraph Theory 17 2 1997 161 228
20. Z. Tuza, and M. Voigt A note on planar 5-list colouring: non-extendability at distance 4 Discrete Mathematics 251 1 2002 169 172
21. J. Urrutia Local solutions for global problems in wireless networks Journal of Discrete Algorithms 5 3 2007 395 407 (Pubitemid 46771382)
22. M. Voigt List colourings of planar graphs Discrete Mathematics 120 13 1993 215 219
23. T. Vredeveld, and J.K. Lenstra On local search for the generalized graph coloring problem Operations Research Letters 31 1 2003 28 34 (Pubitemid 35432902)
24. Y. Wang, X.-Y. Li, Localized construction of bounded degree and planar spanner for wireless ad hoc networks, in: DialM: Proceedings of the Discrete Algorithms and Methods for Mobile Computing & Communications, 2003.