An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs.
Jian GaoZhenghang XuRuizhi LiMinghao YinPublished in: AAAI (2022)
Keyphrases
- upper bound
- branch and bound algorithm
- maximum clique
- lower bound
- branch and bound
- upper and lower bounds
- graph properties
- independent set
- tight bounds
- worst case
- quasi cliques
- graph theoretic
- lower and upper bounds
- gaussian graphical models
- sparse representation
- directed graph
- sparse data
- maximum independent set
- graph mining
- graph matching
- directed acyclic
- maximal clique enumeration
- tight upper and lower bounds
- column generation
- np hard
- high dimensional
- shortest path problem
- sample complexity
- graph databases
- weighted graph
- data analysis