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}
}
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
Highly Cited
This paper has 75 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 39 citations

75 Citations

0510'93'98'04'10'16
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

PARDALOS, An exact algorithmfor the maximum clique problem

  • P. R. CARRAGHAN
  • Tech. Report,
  • 1990
2 Excerpts

An algorithm for finding a maximum weighted independent set in an arbitrary graph

  • N. DESAI, P. M. PARDALOS
  • Tech. Report, Computer Science Department…
  • 1989
2 Excerpts

A node covering algorithm

  • E. BALAS, H. SAMUELSSON
  • Naval Res. Logis. Quart., 24
  • 1977
1 Excerpt

On certain polytopes associated with graphs

  • V. CHVATAL
  • J. Combin. Theory Set. B, 18
  • 1975
1 Excerpt

Some polynomial algorithms for certain graphs and hypergraphs

  • A. FRANK
  • Proc. 5th British Combinatorial Conference…
  • 1975
1 Excerpt