Article ID: | iaor19981306 |
Country: | United States |
Volume: | 20 |
Issue: | 2 |
Start Page Number: | 209 |
End Page Number: | 221 |
Publication Date: | Feb 1991 |
Journal: | SIAM Journal On Computing |
Authors: | Balas E., Jue X. |
Efficient algorithms are known for finding a maximum weight stable set, a minimum weighted clique covering, and a maximum weight clique of a vertex-weighted triangulated graph. However, there is no comparably efficient algorithm in the literature for finding a minimum weighted vertex coloring of such a graph. This paper gives an O(|