We have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic to Kr, with no edges joining any two of the subgraphs) equals the minimum number of cliques of G that meet all the r-cliques of G. When r = 1, this says that chordal graphs have independence number equal to the clique covering number. When r = 2, this is equivalent to a result of Cameron, and it implies a well known forbidden subgraph characterization of split graphs. In this paper we consider a weighted version of the above min–max optimization problem. Given a chordal graph G, with a nonnegative weight for each r-clique in G, we seek a set of independent r-cliques with maximum total weight. We present two algorithms to solve this problem, based on the principle of complementary slackness. The first one operates on a graph derived from G, and is an adaptation of an algorithm of Farber. The second one improves the performance by reducing the number of constraints of the linear programs. Both results produce a min–max relation. When the algorithms are specialized to the situation in which all the r-cliques have the same weight, we simplify the algorithms reported by Hell et al., although these simpler algorithms are not as efficient. As a byproduct, we also obtain new elementary proofs of the above min–max result.
