An exact combinatorial algorithm for minimum graph bisection.
Daniel DellingDaniel FleischmanAndrew V. GoldbergIlya P. RazenshteynRenato F. WerneckPublished in: Math. Program. (2015)
Keyphrases
- k means
- dynamic programming
- learning algorithm
- cost function
- computational complexity
- graph based algorithm
- global minimum
- dominating set
- significant improvement
- square error
- recognition algorithm
- detection algorithm
- graph search
- brute force
- clustering algorithm
- graph structure
- matching algorithm
- expectation maximization
- computational cost
- np hard
- search space
- directed graph
- worst case
- graph clustering
- preprocessing
- maximum flow
- optimal solution
- similarity measure
- decision trees