𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Algorithms for coloring semi-random grap
✍ 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