Algorithm for Finding Minimal and Quaziminimal st-Cuts in Graph.
Andrey GrishkevichPublished in: IP&C (2019)
Keyphrases
- learning algorithm
- worst case
- computational cost
- optimization algorithm
- graph structure
- cost function
- np hard
- matching algorithm
- k means
- dynamic programming
- experimental evaluation
- preprocessing
- graph based algorithm
- probabilistic model
- tree structure
- depth first search
- detection algorithm
- minimum spanning tree
- computational complexity
- optimal solution
- neural network
- solution path
- dominating set
- polynomial time complexity
- breadth first search
- maximum flow
- graph clustering
- graph theory
- bipartite graph
- recognition algorithm
- convex hull
- segmentation algorithm
- expectation maximization
- search space
- genetic algorithm