✦ LIBER ✦

An effective heuristic algorithm for sum coloring of graphs

✍ Scribed by Qinghua Wu; Jin-Kao Hao

Book ID: 113553762
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 285 KB
Volume: 39
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2011.09.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Classification analysis of heuristic alg

Classification analysis of heuristic algorithms for graph coloring

✍ A. A. Shneider 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 958 KB

An algorithm for coloring some perfect g

An algorithm for coloring some perfect graphs

✍ Hacène Aït Haddadène; Sylvain Gravier; Frédéric Maffray 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 881 KB

On sum coloring and sum multi-coloring f

On sum coloring and sum multi-coloring for restricted families of graphs

✍ Allan Borodin; Ioana Ivan; Yuli Ye; Bryce Zimny 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 982 KB

Probabilistic analysis of a heuristic gr

Probabilistic analysis of a heuristic graph coloring algorithm

✍ Tsuyoshi Kawaguchi; Hideo Nakano; Yoshiro Nakanishi 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB

A parallel variant of a heuristical algo

A parallel variant of a heuristical algorithm for graph coloring — Corrigendum

✍ Janez Žerovnik; Matjaž Kaufman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 213 KB

An Õ(n314)-coloring algorithm for 3-col

An Õ(n314)-coloring algorithm for 3-colorable graphs

✍ Avrim Blum; David Karger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 471 KB

We show how the results of Karger, Motwani, and Sudan ( 1994) and Blum ( 1994) can be combined in a natural manner to yield a polynomial-time algorithm for d(n3"4 )-coloring any n-node 3-colorable graph. This improves on the previous best bound of 6(n'14) colors (Karger et al., 1994).