✦ LIBER ✦

Probabilistic analysis of a heuristic graph coloring algorithm

✍ Scribed by Tsuyoshi Kawaguchi; Hideo Nakano; Yoshiro Nakanishi

Book ID: 112075154
Publisher: John Wiley and Sons
Year: 1982
Tongue: English
Weight: 382 KB
Volume: 65
Category: Article
ISSN: 8756-6621
DOI: 10.1002/ecja.4410650603

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

Worst case analysis of a graph coloring

Worst case analysis of a graph coloring algorithm

✍ Jeremy P. Spinrad; Gopalakrishnan Vijayan 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 164 KB

A Range-Compaction Heuristic for Graph C

A Range-Compaction Heuristic for Graph Coloring

✍ Andrea Di Blas; Arun Jagota; Richard Hughey 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 195 KB

A semidefinite programming-based heurist

A semidefinite programming-based heuristic for graph coloring

✍ Igor Dukanovic; Franz Rendl 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Cosine: A new graph coloring algorithm

✍ A. Hertz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 377 KB

A Simple Competitive Graph Coloring Algo

A Simple Competitive Graph Coloring Algorithm

✍ H.A. Kierstead 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 157 KB

We prove that the game coloring number, and therefore the game chromatic number, of a planar graph is at most 18. This is a slight improvement of the current upper bound of 19. Perhaps more importantly, we bound the game coloring number of a graph G in terms of a new parameter r(G). We use this resu