An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs.
Andreas Emil FeldmannPeter WidmayerPublished in: ESA (2011)
Keyphrases
- experimental evaluation
- k means
- adjacency graph
- learning algorithm
- minimum spanning tree
- search space
- cost function
- detection algorithm
- probabilistic model
- preprocessing
- matching algorithm
- graph structure
- three dimensional
- tree structure
- spanning tree
- convergence rate
- segmentation algorithm
- theoretical analysis
- expectation maximization
- high accuracy
- dynamic programming
- computational complexity
- linear programming
- directed graph
- times faster
- clustering method
- markov random field
- worst case
- optimal solution
- decision trees