A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti.
Logan A. SmithDavid T. MildebrathIllya V. HicksPublished in: CoRR (2019)
Keyphrases
- computational complexity
- significant improvement
- worst case
- dynamic programming
- special case
- objective function
- np hard
- input data
- path planning
- detection algorithm
- expectation maximization
- experimental evaluation
- cost function
- computational cost
- convergence rate
- times faster
- optimal solution
- theoretical analysis
- k means
- learning algorithm
- high accuracy
- graph cuts
- computationally efficient
- segmentation algorithm
- optimization algorithm
- search algorithm
- tree structure
- particle swarm optimization
- improved algorithm
- homology generators