✦ LIBER ✦

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

✍ Scribed by Ming-Shing Yu; Cheng-Hsing Yang

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 398 KB
Volume: 48
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90267-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for connectivity pro

Parallel algorithms for connectivity problems on interval graphs

✍ Sanjeev Saxena; N.Malahal Rao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Linear algorithm for optimal path cover

Linear algorithm for optimal path cover problem on interval graphs

✍ Srinivasa Rao Arikati; C. Pandu Rangan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 412 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

A parallel algorithm for the minimum wei

A parallel algorithm for the minimum weighted vertex cover problem

✍ Aristidis Likas; Andreas Stafylopatis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 522 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 polynomial algorithm for the minimum w

A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs

✍ Wen-Lian HSU; George L. Nemhauser 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 688 KB

Discrete Mathematics 3X ( 19X2) 6S-71 North-Holland Publishing Company 65 Let G = (V, E) be a graph with a positive number wt(v) assigned to each L' E V. A weighted clique saver of the vertices of G is a collection of cliques with a non-negative weight yC. assigned to each clique C in the collection