New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory.
Vladimir BravermanZaoxing LiuTejasvam SinghN. V. VinodchandranLin F. YangPublished in: Algorithmica (2018)
Keyphrases
- maximum clique
- maximum weight
- graph properties
- graph theory
- graph representation
- upper bound
- bipartite graph
- tree decomposition
- lower bound
- theoretical framework
- directed graph
- computational model
- graph mining
- general theory
- independent set
- decomposition methods
- graph model
- information theory
- graph matching
- random walk
- special case