Algorithm for the cost edge-coloring of trees

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

Volumn 2108, Issue , 2001, Pages 288-297

  Zhou, Xiao ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COLOR; COLORING; COST FUNCTIONS;

EDGE COLORING; GRAPH G; MAXIMUM DEGREE; REAL NUMBER;

TREES (MATHEMATICS);

EID: 23044529941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_32     Document Type: Conference Paper

References (14)

1. S. Arnborg and J. Lagergren. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2):308–340, 1991.
2. R.B. Borie, R.G. Parker, and C.A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555–581, 1992.
3. E.G. Coffman, M.R. Garey, D.S. Johnson, and A.S. LaPaugh.: Scheduling file transfers. SIAM J. Comput., 14:744–780, 1985.
4. K. Giaro and M. Kubale. Edge-chromatic sum of trees and bounded cyclicity graphs. Information Processing Letters, 75:65–69, 2000.
5. K. Jansen. The optimum cost chromatic partition problem. In Proc. CIAC’97, Lecture Notes in Computer Science, Springer-Verlag, 1203:25–36, 1997.
6. H. Krawczyk and M. Kubale.: An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans. Comput., 34:869–872, 1985.
7. M.Y. Kao, T.W. Lam, W.K. Sung and H.F. Ting. All-cavity maximum matchings. In Proc. ISAAC’97, Lecture Notes in Computer Science, Springer-Verlag, 1350:364–373, 1997.
8. M.Y. Kao, T.W. Lam, W.K. Sung and H.F. Ting. Cavity matchings, label compressions, and evolutionary trees. SIAM J. Comp., 30(2):602–624, 2000.
9. L.G. Kroon, A. Sen, H. Deng, and A. Roy. The optimal cost chromatic partition problem for trees and interval graphs. In Proc. WG’96 International Workshop on Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Springer, 1197:279–292, 1997.
10. M. Kubale.: Introduction to Computational Complexity and Algorithmic Graph Coloring. Gdanskie Towarzystwo Naukowe, Gdansk, Poland, 1998.
11. E. Kubicka. The Chromatic Sum of a Graph. Ph.D. Thesis, Western Michigan University, 1989.
12. C.H. Padadimitriou and K. Steiglitz.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs, NJ, 1982.
13. J. A. Telle and A. Proskurowski.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math., 10:529–550, 1997.
14. X. Zhou, S. Nakano, and T. Nishizeki. Edge-coloring partial k-trees. Journal of Algorithms, 21:598–617, 1996.