Local edge colouring of Yao-like subgraphs of Unit Disk Graphs

Theoretical Computer Science

Volumn 410, Issue 14, 2009, Pages 1388-1400

  Czyzowicz, J ^a   Dobrev, S ^b   Kranakis, E ^c   Opatrny, J ^d   Urrutia, J ^e  

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

^b UNIVERSITY OF OTTAWA   (Canada)

^c CARLETON UNIVERSITY   (Canada)

^d Dept of Electrical and Computer Engineering   (Canada)

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

Author keywords

Edge colouring; Geometric graphs; Local algorithm; Location awareness; Unit Disk Graphs; Wedge; Wireless network

Indexed keywords

ALGORITHMS; COLOR; DISKS (STRUCTURAL COMPONENTS); TELECOMMUNICATION NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

EDGE COLOURING; GEOMETRIC GRAPHS; LOCAL ALGORITHM; LOCATION AWARENESS; UNIT DISK GRAPHS; WEDGE;

WIRELESS NETWORKS;

EID: 60649095129     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.11.008     Document Type: Article

References (18)

1. Barrett T.C., Istrate G., Kumar A., Marathe M., Thite S., and Thulasidasan S. Strong edge coloring for channel assignment in wireless radio networks. IEEE International Workshop on Foundation and Algorithms for Wireless Networking (2006), IEEE
2. Chavez E., Dobrev S., Kranakis E., Opatrny J., Stacho L., Tejeda H., and Urrutia J. Half-space proximal: A new local test for extracting a bounded dilation spanner. Proceedings of OPODIS, 2005. Lecture Notes in Computer Science (2006), Springer Verlag
3. Chavez E., Dobrev S., Kranakis E., Opatrny J., Stacho L., and Urrutia J. Local construction of planar spanners in Unit Disk Graphs with irregular transmission ranges. In: Correa J., Hevia A., and Kiwi M. (Eds). Latin 06. Lecture Notes in Computer Science vol. 3387 (2006), Springer Verlag 286-297
4. Erdös P. On circuits and subgraphs of chromatic graphs. Mathematika 9 (1962) 170-175
5. Gandham S., Dawande M., and Prakash R. Link scheduling in sensor networks: Distributed edge coloring revisited. INFOCOM (2005), IEEE 2492-2501
6. Holyer I. The NP-completeness of edge-coloring. SIAM Journal on Computing 10 4 (1981) 718-720
7. Kodialam M.S., and Nandagopal T. Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels. IEEE/ACM Transactions on Networking 13 4 (2005) 868-880
8. Kumar V.S.A., Marathe M.V., Parthasarathy S., and Srinivasan A. End-to-end packet-scheduling in wireless ad-hoc networks. Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 (2004), SIAM 1021-1030
9. Li X.-Y., Calinescu G., Wan P.-J., and Wang Y. Localized delaunay triangulation with application in ad hoc wireless networks. IEEE Transaction on Parallel and Distributed Systems 14 10 (2003) 1035-1047
10. Linial N. Locality in distributed graph algorithms. SIAM Journal on Computing 21 1 (1992) 193-201
11. Marathe M.V., Breu H., Hunt III H.B., Ravi S.S., and Rosenkrantz D.J. Simple heuristics for Unit Disk Graphs. Networks 25 1 (1995) 59-68
12. Matsui T. Approximation algorithms for maximum independent set problems and fractional coloring problems on Unit Disk Graphs. In: Akiyama J., Kano M., and Urabe M. (Eds). JCDCG. Lecture Notes in Computer Science vol. 1763 (1998), Springer Verlag 194-200
13. Naor M., and Stockmeyer L. What can be computed locally?. SICOMP: SIAM Journal on Computing 24 (1995)
14. Peleg D. Distributed Computing: A Locality-Sensitive Approach (2000), SIAM
15. Ramanathan S. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks 5 2 (1999) 81-94
16. Vizing V.G. On the estimate of the chromatic class of a p-graph. Diskretnaya Analiz 3 (1964) 25-30
17. 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
18. Yao A. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing 11 4 (1982) 721-736