A self-stabilizing algorithm for L(2,1)-labeling trees

Proceedings of the IASTED International Multi-Conference on Applied Informatics

Volumn , Issue , 2005, Pages 627-632

  Chaudhuri, Pranay ^a   Thompson, Hussein ^a  

^a UNIVERSITY OF THE WEST INDIES   (Jamaica)

Author keywords

Algorithms; Distributed system; Graph coloring; Self stabilization

Indexed keywords

COLORING; GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

DISTRIBUTED SYSTEM; GRAPH COLORING; LABELING TREES; SELF-STABILIZATION;

ALGORITHMS;

EID: 27944509133     PISSN: 10272666     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. S. T. Hedetniemi, D. P. Jacobs & P. K. Srimani, Linear time self-stabilizing colorings, Information Processing Letters, 87(5), 2003, 251-255.
2. S. Sur, & P. K. Srimani, A self-stabilizing algorithm for coloring bipartite graphs, Information Sciences, 69(3), 1993, 219-227.
3. H. L. Bodlaender, T. Kloks, & R. B. Tan, J. V. Leeuwen, Approximations for λ-colorings of graphs, The Computer Journal, 47(2), 2004, 193-204.
4. J. P. Georges, & D. W. Mauro, Generalized vertex labelings with a condition at distance two, Congressus Numerantium, 109, 1995, 141-159.
5. J. P. Georges, & D. W. Mauro, Labeling trees with a condition at distance two, Discrete Mathematics, 269(1-3), 2003, 127-148.
6. J. R. Griggs, & R. K. Yeh, Labeling graphs with a condition at distance two, SIAM Journal of Discrete Mathematics, 5(4), 1992, 586 - 595.
7. G. J. Chang, & S. C. Liaw, The L(2, 1)-labeling problem on ditrees, Ars Combinatoria, 66, 2003, 23-31.
8. T. Calamoneri, & R. Petreschi, L(2, 1)-labeling of planar graphs, Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Rome, Italy, 2001, 28-33.
9. G. J. Chang, & D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM Journal of Discrete Mathematics, 9(2), 1996, 309-316.
10. G. J. Chang, W.-T. Ke, D. Kuo, D. D.-F. Liu, & R. K. Yeh, On L(d, 1)-labelings of graphs, Discrete Mathematics, 220(1-3), 2000, 57 - 66.
11. W. K. Hale, Frequency assignment: Theory and applications, Proceedings of the IEEE, 65(12), 1980, 1497-1514.
12. E. W. Dijkstra, Self-stabilizing systems in spite of distributed control, Communications of the ACM, 17(11), 1974, 643-644.
13. P. Chaudhuri, A self-stabilizing algorithm for detecting fundamental cycles in a graph, Journal of Computer and System Sciences, 59(1), 1999, 84-93.
14. Z. Collin, & S. Dolev, Self-stabilizing depth-first search, Information Processing Letters, 49(6), 1994, 297 -301.
15. M. H. Karaata, & P. Chaudhuri, A self-stabilizing algorithm for bridge finding, Distributed Computing, 72(1), 1999, 47-53.
16. S. Chen, H. P. Yu, & S. T. Huang, A self-stabilizing algorithm for constructing spanning trees, Information Processing Letters, 59(3), 1991, 147-151
17. S. T. Huang, & N. S. Chen, A self-stabilizing algorithm for constructing breadth-first trees, Information Processing Letters, 41(2), 1992, 109-117.