Hamiltonicity of Simplicial-Connected Graphs: An Algorithm Based on Clique Decomposition.
Thierry ValléeAlain BrettoPublished in: ITNG (2008)
Keyphrases
- learning algorithm
- experimental evaluation
- computational complexity
- computationally efficient
- objective function
- selection algorithm
- k means
- significant improvement
- detection algorithm
- optimization algorithm
- improved algorithm
- matching algorithm
- theoretical analysis
- worst case
- probabilistic model
- np hard
- cost function
- high accuracy
- simulated annealing
- particle swarm optimization
- expectation maximization
- input image
- computational cost
- times faster
- pairwise
- optimal solution