✦ LIBER ✦

Numerical experiences with graph coloring algorithms

✍ Scribed by Jürgen Peemöller

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 426 KB
Volume: 24
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(86)90020-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scalable parallel graph coloring algorit

Scalable parallel graph coloring algorithms

✍ Gebremedhin, Assefaw Hadish ;Manne, Fredrik 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 1 views

Sequential and distributed graph colorin

Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces

✍ Eli Shamir; Eli Upfal 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 608 KB

Numerical experiments with MG continuati

Numerical experiments with MG continuation algorithms

✍ Gh. Juncu; E. Mosekilde; C. Popa 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 207 KB

A fast parallel algorithm to color a gra

A fast parallel algorithm to color a graph with Δ colors

✍ Mauricio Karchmer; Joseph Naor 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 502 KB

New geometric programming algorithms wit

New geometric programming algorithms with numerical experiments

✍ A.V. Pokatayev 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 657 KB

Algorithms for coloring semi-random grap

Algorithms for coloring semi-random graphs

✍ C. R. Subramanian; Martin Fürer; C. E. Veni Madhavan 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB 👁 3 views

The graph coloring problem is to color a given graph with the minimum number of colors. This problem is known to be NP-hard even if we are only aiming at approximate solutions. On the other hand, the best known approximation algorithms require ␦ Ž . Ž . n ␦ ) 0 colors even for bounded chromatic k-co