Algorithm for the cost edge-coloring of trees

Journal of Combinatorial Optimization

Volumn 8, Issue 1, 2004, Pages 97-108

  Zhou, Xiao ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Bipartite graph; Cost edge coloring; Matching; Tree

Indexed keywords

ALGORITHMS; COLORING; COMPUTATIONAL COMPLEXITY; COSTS; GRAPH THEORY; PROBLEM SOLVING; SCHEDULING; THEOREM PROVING;

BIPARTITE GRAPH; COST EDGE-COLORING; MATCHING; VERTEX-COLORING PROBLEMS;

TREES (MATHEMATICS);

EID: 3543055792     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOCO.0000021940.40066.0c     Document Type: Article

References (16)

1. S. Arnborg and J. Lagergren, "Easy problems for tree-decomposable graphs," Journal of Algorithms, vol. 12, no. 2, pp. 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, vol. 7, pp. 555-581, 1992.
3. E.G. Coffman, M.R. Garey, D.S. Johnson, and A.S. LaPaugh, "Scheduling file transfers," SIAM J. Comput., vol. 14, pp. 744-780, 1985.
4. K. Giaro and M. Kubale, "Edge-chromatic sum of trees and bounded cyclicity graphs," Information Processing Letters, vol. 75, pp. 65-69, 2000.
5. H. Hajiabolhassan, M.L. Mehrabadi, and R. Tusserkani, "Minimal coloring and strength of graphs," Discrete Mathematics, vol. 215, pp. 265-270, 2000.
6. K. Jansen, "The optimum cost chromatic partition problem," in Proc. CIAC'97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1203, 1997, pp. 25-36.
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, vol. 1350, 1997, pp. 364-373.
8. M.Y. Kao, T.W. Lam, W.K. Sung, and H.F. Ting, "Cavity matchings, label compressions, and evolutionary trees," SIAM J. Comp., vol. 30, no. 2, pp. 602-624, 2000.
9. H. Krawczyk and M. Kubale, "An approximation algorithm for diagnostic test scheduling in multicomputer systems," IEEE Trans. Comput., vol. 34, pp. 869-872, 1985.
10. 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, vol. 1197, 1997, pp. 279-292.
11. M. Kubale, Introduction to Computational Complexity and Algorithmic Graph Coloring, Gdańskie Towarzystwo Naukowe, Gdańsk, Poland, 1998.
12. E. Kubicka, "The chromatic sum of a graph," Ph.D. Thesis, Western Michigan University, 1989.
13. C.H. Padadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall: Englewood Cliffs, NJ, 1982.
14. J.A. Telle and A. Proskurowski, "Algorithms for vertex partitioning problems on partial k-trees," SIAM J. Discrete Math., vol. 10, pp. 529-550, 1997.
15. X., Zhou, S. Nakano, and T. Nishizeki, "Edge-coloring partial k-trees," Journal of Algorithms, vol. 21, pp. 598-617, 1996.
16. X. Zhou and T. Nishizeki, "Algorithm for the cost edge-coloring of trees," in Proc. of the 7th Annual International Conference on Computing and Combinatorics, Lect. Notes in Computer Science, Springer, vol. 2108, 2001, pp. 288-297.