A simple algorithm to find Hamiltonian cycles in proper interval graphs.
Louis IbarraPublished in: Inf. Process. Lett. (2009)
Keyphrases
- cost function
- learning algorithm
- times faster
- detection algorithm
- np hard
- matching algorithm
- optimization algorithm
- probabilistic model
- dynamic programming
- recognition algorithm
- preprocessing
- multi objective
- significant improvement
- knn
- expectation maximization
- graph model
- segmentation algorithm
- optimal solution
- objective function
- minimum spanning tree
- graph partitioning
- spanning tree
- neural network
- graph structure
- minimum length
- clustering method
- computationally efficient
- particle swarm optimization
- computational cost
- mobile robot
- computational complexity