A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width.
Kevin CattellMichael J. DinneenMichael R. FellowsPublished in: Inf. Process. Lett. (1996)
Keyphrases
- experimental evaluation
- optimization algorithm
- computational complexity
- improved algorithm
- cost function
- segmentation algorithm
- expectation maximization
- input data
- minimum length
- optimal solution
- detection algorithm
- neural network
- selection algorithm
- path planning
- particle swarm optimization
- high accuracy
- worst case
- computational cost
- dynamic programming
- np hard
- k means
- preprocessing
- learning algorithm
- probabilistic model
- search algorithm
- objective function
- convex hull
- image segmentation
- optimal path
- path finding
- data sets