Packing r-Cliques in Weighted Chordal Graphs

P. Hell (), S. Klein (), L. Nogueira () and F. Protti ()

Annals of Operations Research, 2005, vol. 138, issue 1, 179-187

Abstract: In 1 , 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 K r , 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 (1989), 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 (1982). 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 in 1 , although these simpler algorithms are not as efficient. As a byproduct, we also obtain new elementary proofs of the above min-max result. Copyright Springer Science + Business Media, Inc. 2005

Keywords: chordal graphs; min-max theorems; greedy algorithms; linear programming duality; complementary slackness (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-005-2452-3 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:138:y:2005:i:1:p:179-187:10.1007/s10479-005-2452-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-005-2452-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().