✦ LIBER ✦

A coloring problem for weighted graphs

✍ Scribed by D.J. Guan; Zhu Xuding

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 515 KB
Volume: 61
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00002-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new polynomial-time algorithm for the

A new polynomial-time algorithm for the maximum weighted (χ(G) — 1)-coloring problem in comparability graphs

✍ A. Hertz 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 363 KB

Solving the minimum-weighted coloring pr

Solving the minimum-weighted coloring problem

✍ Massimiliano Caramia; Paolo Dell'Olmo 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

Weighted-Set Graph Colorings

✍ Robert Shrock; Yan Xu 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 767 KB

A parallel algorithm for solving the col

A parallel algorithm for solving the coloring problem on trapezoid graphs

✍ Shin-ichi Nakayama; Shigeru Masuyama 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 501 KB

Circular colorings of weighted graphs

✍ Deuber, Walter A.; Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 776 KB

Suppose that G is a finite simple graph and w is a weight function which assigns to each vertex of G a nonnegative real number. Let C be a circle of length t . A t-circular coloring of (G,w) is a mapping A of the vertices of G to arcs of C such that A(%) n A(y) = 0 if (x, y) E E ( G ) and A(x) has l

On the Sum Coloring Problem on Interval

On the Sum Coloring Problem on Interval Graphs

✍ S. Nicoloso; M. Sarrafzadeh; X. Song 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 203 KB