KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem.
Jiongzhi ZhengMingming JinKun HePublished in: CoRR (2023)
Keyphrases
- upper bound
- worst case
- learning algorithm
- preprocessing
- computational complexity
- improved algorithm
- experimental evaluation
- linear programming
- branch and bound
- k means
- matching algorithm
- detection algorithm
- optimization algorithm
- dynamic programming
- objective function
- optimal solution
- high accuracy
- lower and upper bounds
- mobile robot
- np hard
- lower bound
- neural network
- particle swarm optimization
- expectation maximization
- computationally efficient
- theoretical analysis
- cost function
- significant improvement
- times faster
- evolutionary algorithm
- convergence rate
- highly efficient
- video sequences