✦ LIBER ✦

Lower Bounds for the Minimal Sum Coloring Problem

✍ Scribed by A. Moukrim; K. Sghiouer; C. Lucet; Y. Li

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Ant Colony Optimization Algorithm

✍ Sidi Mohamed Douiri, Souad Elbernoussi 📂 Article 📅 2012 🏛 Springer Netherlands 🌐 English ⚖ 296 KB

Lower bounds for on-line graph coloring

✍ Magnus M. Halldórsson; Mario Szegedy 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 771 KB

A memetic algorithm for the Minimum Sum

✍ Jin, Yan; Hao, Jin-Kao; Hamiez, Jean-Philippe 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 549 KB

Lower bounds for Turán's problem

✍ Peter Frankl; Vojtěch Rödl 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 138 KB

On the Sum Coloring Problem on Interval

✍ S. Nicoloso; M. Sarrafzadeh; X. Song 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 203 KB

Lower Bounds For Multidimensional Zero S

✍ Christian Elsholtz 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 160 KB