✦ LIBER ✦

Efficient Constraint Propagation for Graph Coloring

✍ Scribed by Frédéric Boussemart; Fred Hemery; Christophe Lecoutre; Mouny Samy Modeliar

Book ID: 108120814
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 283 KB
Volume: 37
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.05.042

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constraint Propagation in Graph Coloring

✍ Massimiliano Caramia; Paolo Dell'Olmo 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 184 KB

Efficient algorithms for acyclic colorin

Efficient algorithms for acyclic colorings of graphs

✍ Zhi-Zhong Chen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Hybrid Evolutionary Algorithms for Graph

Hybrid Evolutionary Algorithms for Graph Coloring

✍ Philippe Galinier; Jin-Kao Hao 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 101 KB

Strengthening the Lovászbound for graph

Strengthening the Lovászbound for graph coloring

✍ Philippe Meurdesoif 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 299 KB

Graph coloring bounds for cellular radio

✍ Pierre Baldi; Edward C. Posner 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 321 KB

A graph coloring problem usdul in deciding whether a set of call requests in cellular radio is compatible with frequency use constraints is introduced. Lower and upper bounds are obtained for the hexagonal cell case typical of raany urban cellular systems. These bounds are on the number of frequenci

Learning classifier system for graph col

Learning classifier system for graph coloring

✍ Zoheir Ezziane 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 691 KB