Local algorithms for edge colorings in UDGs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5911 LNCS, Issue , 2010, Pages 202-213

  Kanj, Iyad A ^a   Wiese, Andreas ^b   Zhang, Fenghui ^c  

^a DEPAUL UNIVERSITY   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC WIRELESS SENSOR NETWORKS; APPROXIMATION RATIOS; CENTRALIZED ALGORITHMS; CENTRALIZED MODELS; COMPUTATION TIME; DISTRIBUTED ALGORITHM; DISTRIBUTED APPROXIMATION ALGORITHM; EDGE COLORING; EDGE COLORING PROBLEMS; LOCAL ALGORITHM; MODEL LINKS; NP COMPLETE; STRONG EDGE COLORING; UNIT DISK GRAPHS; UPPER BOUND;

AD HOC NETWORKS; COLORING; COMPUTATION THEORY; DISKS (STRUCTURAL COMPONENTS); PARALLEL ALGORITHMS; SENSOR NETWORKS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 72249090682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11409-0_18     Document Type: Conference Paper

References (14)

1. Barrett, C., Kumar, V., Marathe, M., Thite, S., Istrate, G.: Strong edge coloring for channel assignment in wireless radio networks. In: PERCOMW 2006, pp. 106-110 (2006)
2. Czyzowicz, J., Dobrev, S., Kranakis, E., Opatrny, J., Urrutia, J.: Local edge colouring of yao-like subgraphs of unit disk graphs. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 195-207. Springer, Heidelberg (2007)
3. Gandham, S., Dawande, M., Prakash, R.: Link scheduling in sensor networks: distributed edge coloring revisited. In: INFOCOM, pp. 2492-2501 (2005)
4. Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718-720 (1981)
5. Ito, T., Kato, A., Zhou, X., Nishizeki, T.: Algorithms for finding distance-edgecolorings of graphs. J. Discrete Algorithms 5(2), 304-322 (2007)
6. Kanj, I., Wiese, A., Zhang, F.: Computing the k-hop neighborhoods locally. Technical report # 08-007 at:http://www.cdm.depaul.edu/research/Pages/ TechnicalReports.aspx
7. Kodialam, M., Nandagopal, T.: Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels. IEEE/ACM Trans. Netw. 13(4), 868-880 (2005)
8. Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193-201 (1992)
9. Mahdian, M.: On the computational complexity of strong edge coloring. Discrete Applied Mathematics 118(3), 239-248 (2002)
10. Misra, J., Gries, D.: A constructive proof of vizing's theorem. IPL 41 (1992)
11. Ramanathan, S.: A unified framework and algorithm for channel assignment in wireless networks. Wirel. Netw. 5(2), 81-94 (1999)
12. Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multihop radio networks. IEEE/ACM Trans. Netw. 1(2), 166-177 (1993)
13. Vizing, V.: On the estimate of the chromatic class of p-graphs. Diskret. Analiz 3, 25-30 (1964)
14. Wiese, A., Kranakis, E.: Local construction and coloring of spanners of location aware unit disk graphs. Technical report # 07-18 at, http://www.scs.carleton.ca/~kranakis/Papers/TR-07-18.pdf