A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs.
Jason LiDebmalya PanigrahiThatchaphol SaranurakPublished in: CoRR (2021)
Keyphrases
- dynamic programming
- detection algorithm
- optimal solution
- learning algorithm
- preprocessing
- np hard
- significant improvement
- recognition algorithm
- segmentation algorithm
- worst case
- objective function
- search space
- globally optimal
- cost function
- locally optimal
- computational complexity
- computational cost
- exhaustive search
- matching algorithm
- optimal parameters
- undirected graph
- np complete
- similarity measure
- finding the shortest path
- adjacency graph
- hyper graph
- tree structure
- optimization algorithm
- particle swarm optimization
- linear programming
- k means
- evolutionary algorithm
- pairwise
- search algorithm
- data structure
- image segmentation