Highly Influenced

# Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs

@article{Balas1991MinimumWC, title={Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs}, author={Egon Balas and Jue Xue}, journal={SIAM J. Comput.}, year={1991}, volume={20}, pages={209-221} }

- Published in SIAM J. Comput. 1991
DOI:10.1137/0220012

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(] VI 2) procedure for the problem (Algorithm 1). It then extends the procedure to the problem of finding in an arbitrary graph G--(V, E) a maximal induced subgraph Gâ€¦Â CONTINUE READING

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 75 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**75**citations based on the available data.See our **FAQ** for additional information.

#### References

##### Publications referenced by this paper.

Showing 1-10 of 10 references

Highly Influential