A self-stabilizing algorithm for the minimum color sum of a graph

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

Volumn 4904 LNCS, Issue , 2008, Pages 209-214

  Sun, Huang ^a   Effantin, Brice ^b   Kheddouci, Hamamache ^b  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS; COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

CHROMATIC SUM; NETWORK CHARGE; SELF-STABILIZING ALGORITHMS;

ALGORITHMS;

EID: 39149086400     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77444-0_19     Document Type: Conference Paper

References (20)

1. Antonoiu, G., Srimani, P.K.: A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph. Computer & Mathematics with Application 35(10), 15-23 (1998)
2. Bar-Noy, A., Bellare, M., Halldórsson, M., Shashnai, H., Tamir, T.: On Chromatic Sums and Distributed Resource Allocation. Information and Computation 140, 183-202 (1998)
3. Bar-Noy, A., Kortsarz, G.: Minimum color sum of bipartite graphs. Journal of Algorithms 28(2), 339-365 (1998)
4. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of ACM 17(11), 643-644 (1974)
5. Effantin, B., Kheddouci, H.: Sum coloring of distance and circulant graphs. In: 7th International Colloquium on Graph Theory. Electronic Notes in Discrete Mathematics, vol. 22, pp. 239-244 (2005)
6. Ghosh, S., Karaata, M.H.: A self-stabilizing algorithm for coloring planar graph. Distributed Compututing 7(1), 55-59 (1993)
7. Gradinariu, M., Tixeuil, S.: Self-stabilizing vertex coloring of arbitrary graphs. In: OPODIS 2000. Proceedings of the International Conference on Principles of Distributed Systems, pp. 55-70 (2000)
8. Hajiabolhassan, H., Mehrabadi, M.L., Tusserkani, R.: Minimal Coloring and Strength of Graphs. Discrete Mathematics 215(1-3), 265-270 (2000)
9. Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Linear time self-stabilizing colorings. Information Processing Letters 87, 251-255 (2003)
10. Hsi, S-C., Huang, S-T.: A self-stabilizing algorithm for maximal matching. Information Processing Letters 43(2), 77-81 (1992)
11. Huang, S.-T., Hung, S.-S., Tzeng, C.-H.: Self-stabilizing coloration in anonymous planar networks. Information Processing Letters 95, 307-312 (2005)
12. Jiang, T., West, D.B.: Coloring of Trees with Minimum Sum of Colors. Journal of Graph Theory 32, 354-358 (1999)
13. Kubicka, E.: The chromatic sum of a graph, Ph.D. Dissertation. Western Michigan University, Kalamazoo, MI (1989)
14. Kubicka, E., Schwenk, A.J.: An introduction to chromatic sums. In: Proceedings of the seventeenth annual ACM conference on Computer science, pp. 39-45 (1989)
15. Nicoloso, S.: Sum coloring and interval graphs: A tight upper bound for the minimum number of colors. Discrete Mathematics 280, 251-257 (2004)
16. Salavatipour, M.: On Sum Coloring of Graphs. Discrete Applied Mathematics 127(3), 477-488 (2003)
17. Shi, Z., Goddard, W., Hedetniemi, S.T.: An anonymous self-stabilizing algorithm for 1-maximal independant set in trees. Information Processing Letters 91, 77-83 (2004)
18. Shukla, S., Rosenkrantz, D., Ravi, S.: Development self-stabilizing coloring algorithms via systematic randomization. In: Proceedings of the International Workshop on Parallel Processing, pp. 668-673 (1994)
19. Supowit, K.J.: Finding a maximum planar subset of nets in a channel. IEEE Transactions on Computer Aided Design 6(1), 93-94 (1987)
20. Sur, S., Srimani, P.K.: A self-stabilizing algorithm for coloring bipartite graphs. Information Science 69, 219-227 (1993)