New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory.
Vladimir BravermanZaoxing LiuTejasvam SinghN. V. VinodchandranLin F. YangPublished in: MFCS (2) (2015)
Keyphrases
- lower bound
- maximum weight
- upper bound
- theoretical framework
- graph properties
- independent set
- directed graph
- maximum clique
- structural learning
- quasi cliques
- graph theory
- graph partitioning
- graph representation
- maximal clique enumeration
- maximum independent set
- large deviations
- tree decomposition
- general theory
- decomposition method
- upper and lower bounds
- graph theoretic
- directed acyclic graph
- bipartite graph
- error bounds
- structured data
- worst case