An Optimum Theta (n log n) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals.
Glenn K. ManacherTerrance A. MankusCarol Joan SmithPublished in: Inf. Process. Lett. (1990)
Keyphrases
- worst case
- hamiltonian path
- initial set
- experimental evaluation
- learning algorithm
- k means
- times faster
- computational cost
- high accuracy
- input data
- method finds
- detection algorithm
- preprocessing
- recognition algorithm
- segmentation algorithm
- decomposition algorithm
- search algorithm
- optimal solution
- optimization algorithm
- probability distribution
- matching algorithm
- significant improvement
- convergence rate
- search space
- uniform distribution
- undirected graph
- computational complexity
- canonical form
- polynomial time complexity
- objective function