๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A polynomial algorithm for the minimum w
โœ 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