An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs.
Martin FürerPublished in: ICALP (1991)
Keyphrases
- directed graph
- experimental evaluation
- detection algorithm
- optimal solution
- learning algorithm
- objective function
- recognition algorithm
- shortest path problem
- convergence rate
- clustering method
- computational cost
- computational complexity
- simulated annealing
- computationally efficient
- np hard
- significant improvement
- matching algorithm
- k means
- search space
- preprocessing
- worst case