A coloring problem for weighted graphs

Information Processing Letters

Volumn 61, Issue 2, 1997, Pages 77-81

  Guan, D J ^a   Zhu, Xuding ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Combinatorial problems; Design of algorithms; Greedy coloring; Optimal coloring; Real time message transmission; Weighted graph

Indexed keywords

EID: 0041720947     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00002-1     Document Type: Article

References (9)

1. S. Arnborg, J. Lagergren and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991) 308-340.
2. D. Bean, Effective coloration, J. Symbolic Logic 41 (1976) 469-480.
3. 5, SIAM J. Discrete Math. 8 (4) (1988) 485-498.
4. C.-C. Han, C.J. Ho and K.G. Shin, On slot allocation for time-constrained messages in DQDB networks, in: Proc. INFOCOM'95, 1995.
5. C.-C. Han, C.-J. Hou and K.G. Shin, On slot reuse for isochronous services in DQDB networks, in: Proc. 16th IEEE Real-Time Systems Symp., Pisa, Italy (1995) 222-231.
6. IEEE802.6, IEEE standard for local and metropolitan networks: Distributed dual bus subnetwork of a metropolitan area network, 1991.
7. H.A. Kierstead, The linearity of first-fit coloring of interval graphs, SIAM J. Discrete Math. 1 (4) (1988) 526-530.
8. J. Naor, MG. Luby and A. Orda, Tight bounds for dynamic storage allocation, SIAM J. Discrete Math. 9 (1) (1996) 155-166.
9. N. Robertson and P.D. Seymour, Graph minors. II. Algorithmic aspects of treewidth, J. Algorithms 7 (1986) 309-322.