A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem.
Hao PanBalabhaskar BalasundaramJuan Sebastian BorreroPublished in: INOC (2022)
Keyphrases
- learning algorithm
- detection algorithm
- cost function
- graph based algorithm
- segmentation algorithm
- experimental evaluation
- similarity measure
- shortest path problem
- high accuracy
- dynamic programming
- computational cost
- search space
- k means
- minimum spanning tree
- graph structure
- decomposition algorithm
- matching algorithm
- clustering method
- computational complexity
- linear programming
- probabilistic model
- strongly connected components
- polynomial time complexity
- decomposition methods
- dominating set
- decomposition method
- association rules
- wavelet packet
- spanning tree
- recognition algorithm
- convergence rate
- random walk
- np complete
- expectation maximization
- graphical models