✦ LIBER ✦

An optimal greedy heuristic to color interval graphs

✍ Scribed by Stephan Olariu

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 624 KB
Volume: 37
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90245-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An asymptotically optimal greedy heurist

An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case

✍ H. Edwin Romeijn; Dolores Romero Morales 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

An optimal algorithm to solve the all-pa

An optimal algorithm to solve the all-pair shortest path problem on interval graphs

✍ R. Ravi; Madhav V. Marathe; C. Pandu Rangan 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB

A simple optimal parallel algorithm for

A simple optimal parallel algorithm for the minimum coloring problem on interval graphs

✍ Ming-Shing Yu; Cheng-Hsing Yang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 398 KB

An algorithm to optimally color a mesh

✍ Jean-Jacques Droux 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 802 KB

An optimal parallel algorithm for the do

An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model

✍ Ming-Shing Yu; Cheng-Hsing Yang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 646 KB

Structural properties of plane graphs wi

Structural properties of plane graphs without adjacent triangles and an application to 3-colorings

✍ O. V. Borodin 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB 👁 1 views

If in a plane graph with minimum degree 2 3 no t w o triangles have an edge in common, then: (1 there are two adjacent vertices with degree sum at most 9, and (2) there is a face of size between 4 and 9 or a 10-face incident with ten 3-vertices. It follows that every planar graph without cycles betw