) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs.
Andreas Emil FeldmannPeter WidmayerPublished in: Algorithmica (2015)
Keyphrases
- learning algorithm
- experimental evaluation
- preprocessing
- detection algorithm
- dynamic programming
- simulated annealing
- times faster
- np hard
- objective function
- computational complexity
- recognition algorithm
- matching algorithm
- computational cost
- graph isomorphism
- segmentation algorithm
- linear programming
- neural network
- cost function
- significant improvement
- k means
- search space
- improved algorithm
- adjacency graph
- data structure