Self-stabilizing algorithms for graph coloring with improved performance guarantees

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

Volumn 4029 LNAI, Issue , 2006, Pages 1150-1159

  Kosowski, Adrian ^a   Kuszner, Łukasz ^a  

^a GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; GRAPH THEORY; KNOWLEDGE BASED SYSTEMS; PROBLEM SOLVING; WIRELESS TELECOMMUNICATION SYSTEMS;

CODE ASSIGNMENT; GRAPH COLORING; SELF-STABILIZING MODEL; SPANNING TREES;

ALGORITHMS;

EID: 33746239137     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785231_120     Document Type: Conference Paper

References (16)

1. R. Battiti, A.A. Bertossi, M.A. Bonucceli, Assigning code in wireless networks: bounds and scaling properties, Wireless Networks, 5, 195-209, 1999.
2. J. Beauquier, A. Kumar Datta, M. Gradinariu, F. Magniette, Self-Stabilizing Local Mutual Exclusion and Definition Refinement, Chicago Journal of Theoretical Computer Science, 2002.
3. G.G. Chachis, If it walks like a duck: nanosensor threat assessment. Proc. SPIE 5090, 341-347, 2003.
4. E.W. Dijkstra, Self-stabilizing systems in spite of distributed control, Communications of the ACM 17, 643-644, 1974.
5. S. Dolev, Self-stabilization, MIT Press, 2000.
6. S. Ghosh, M.H. Karaata, A Self-Stabilizing Algorithm for Coloring Planar Graphs, Distributed Computing 7, 55-59, 1993.
7. Grundy, P. M.: Mathematics and games. Eureka 2 (1939), 6-8.
8. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, P.K. Srimani, Fault Tolerant Algorithms for Orderings and Colorings, Proc. IPDPS'04, 2004.
9. M. Gradinariu, S. Tixeuil, Self-stabilizing Vertex Coloring of Arbitrary Graphs, Proc. OPODIS'00, 55-70, 2000.
10. S.T. Hedetniemi, D.P. Jacobs, P.K. Srimani, Linear time self-stabilizing colorings, Information Processing Letters 87, 251-255, 2003.
11. L. Hu, Distributed code assignments for CDMA Packet Radio Network, IEEE/ACM Transactions on Networking 1, 668-677, 1993.
12. S.T. Huang, S.S. Hung, C.H. Tzeng, Self-stabilizing coloration in anonymous planar networks, Information Processing Letters 95, 307-312, 2005.
13. K.W. Hung T.S. Yum An efficient code assignment algorithm for multihop spread spectrum packet radio networks, Proc. GLOBECOM'90, 271-274, 1990.
14. A. Kosowski, L. Kuszner, A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves, Proc. PPAM'05, LNCS 3911 (to appear), 2006.
15. J. Li, C. Blake, D.S. De Couto, H.I. Lee, R. Morris, Capacity of Ad Hoc wireless networks. Proc. MobiCom'01. ACM Press, 61-69, 2001.
16. S. Sur, P.K. Srimani, A self-stabilizing algorithm for coloring bipartite graphs, Information Sciences 69, 219-227, 1993.