A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs.
Shaowei CaiJinkun LinYiyuan WangDarren StrashPublished in: J. Artif. Intell. Res. (2021)
Keyphrases
- maximum weight
- learning algorithm
- bipartite graph
- dynamic programming
- independent set
- np hard
- weighted graph
- minimum weight
- graph structure
- computational complexity
- bipartite matching
- segmentation algorithm
- convergence rate
- bipartite graph matching
- maximum clique
- combinatorial optimization
- tree structure
- itemsets
- worst case
- data structure