Algorithm for two disjoint long paths in 2-connected graphs.
Shan ZhouHao LiGuanghui WangPublished in: Theor. Comput. Sci. (2010)
Keyphrases
- experimental evaluation
- optimization algorithm
- learning algorithm
- times faster
- search space
- computational complexity
- clustering method
- theoretical analysis
- worst case
- improved algorithm
- matching algorithm
- detection algorithm
- segmentation algorithm
- computationally efficient
- probabilistic model
- dynamic programming
- computational cost
- image processing
- np hard
- optimal path
- selection algorithm
- recognition algorithm
- cost function
- memory requirements
- similarity measure
- experimental study
- single pass
- image segmentation
- preprocessing
- lower bound
- k means
- significant improvement
- particle swarm optimization
- linear programming
- simulated annealing
- neural network
- motion estimation