✦ LIBER ✦

A Range-Compaction Heuristic for Graph Coloring

✍ Scribed by Andrea Di Blas; Arun Jagota; Richard Hughey

Book ID: 111584174
Publisher: Springer US
Year: 2003
Tongue: English
Weight: 195 KB
Volume: 9
Category: Article
ISSN: 1381-1231
DOI: 10.1023/b:heur.0000012448.70007.32

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A semidefinite programming-based heurist

A semidefinite programming-based heuristic for graph coloring

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

Classification analysis of heuristic alg

Classification analysis of heuristic algorithms for graph coloring

✍ A. A. Shneider 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 958 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 graph coloring constructive hyper-heur

A graph coloring constructive hyper-heuristic for examination timetabling problems

✍ Nasser R. Sabar, Masri Ayob, Rong Qu, Graham Kendall 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 450 KB

Parallel Heuristics for Improved, Balanc

Parallel Heuristics for Improved, Balanced Graph Colorings

✍ Robert K. Gjertsen; Jr.; Mark T. Jones; Paul E. Plassmann 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 399 KB

The computation of good, balanced graph colorings is an essential part of many algorithms required in scientific and engineering applications. Motivated by an effective sequential heuristic, we introduce a new parallel heuristic, PLF, and show that this heuristic has the same expected runtime under

A search space “cartography” for guiding

A search space “cartography” for guiding graph coloring heuristics

✍ Daniel Cosmin Porumbel; Jin-Kao Hao; Pascale Kuntz 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 317 KB