KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem.
Mingming JinJiongzhi ZhengKun HePublished in: AAAI (2024)
Keyphrases
- upper bound
- detection algorithm
- worst case
- preprocessing
- k means
- computational cost
- computational complexity
- lower bound
- computationally efficient
- experimental evaluation
- ant colony optimization
- matching algorithm
- dynamic programming
- brute force
- significant improvement
- segmentation algorithm
- lower and upper bounds
- exact solution
- improved algorithm
- minimum distance
- error probability
- clustering method
- high accuracy
- np hard
- search space
- optimal solution
- optimization algorithm
- recognition algorithm
- objective function
- highly efficient
- particle swarm optimization
- upper and lower bounds
- memory efficient
- maximum weight