✦ LIBER ✦

On the probabilistic minimum coloring and minimum -coloring

✍ Scribed by Cécile Murat; Vangelis Th. Paschos

Book ID: 108112551
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 394 KB
Volume: 154
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.06.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum entropy coloring

✍ Jean Cardinal; Samuel Fiorini; Gwenaël Joret 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 439 KB

Solving the minimum-weighted coloring pr

Solving the minimum-weighted coloring problem

✍ Massimiliano Caramia; Paolo Dell'Olmo 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

The complexity of minimum convex colorin

The complexity of minimum convex coloring

✍ Frank Kammer; Torsten Tholey 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 796 KB

Minimum feedback vertex set and acyclic

Minimum feedback vertex set and acyclic coloring

✍ Guillaume Fertin; Emmanuel Godard; André Raspaud 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 132 KB

In the feedback vertex set problem, the aim is to minimize, in a connected graph G = (V , E), the cardinality of the set V (G) ⊆ V , whose removal induces an acyclic subgraph. In this paper, we show an interesting relationship between the minimum feedback vertex set problem and the acyclic coloring

Solving the Minimum Weighted Integer Col

Solving the Minimum Weighted Integer Coloring Problem

✍ Jue Xue 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 362 KB

Approximation results for the minimum gr

Approximation results for the minimum graph coloring problem

✍ Marc Demange; Pascal Grisoni; Vangelis Th. Paschos 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 381 KB