𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs

✍ Scribed by Xueliang Li; Wenan Zang

Book ID
106406970
Publisher
Springer US
Year
2005
Tongue
English
Weight
215 KB
Volume
9
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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