Clique partitioning of interval graphs with submodular costs on the cliques.
Dion GijswijtVincent JostMaurice QueyrannePublished in: RAIRO Oper. Res. (2007)
Keyphrases
- maximum clique
- maximal cliques
- maximal clique enumeration
- branch and bound algorithm
- graph partitioning
- association graph
- graph properties
- graph structure
- weighted graph
- independent set
- graph theory
- computational biology
- greedy algorithm
- total cost
- spectral graph
- partitioning algorithm
- junction tree
- quasi cliques
- high order
- lower bound
- spanning tree
- cost savings
- graph matching
- graph representation
- graph model
- random walk