Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs
Elias DahlhausPéter HajnalMarek KarpinskiPublished in: FOCS (1988)
Keyphrases
- parallel algorithm
- hamiltonian cycle
- binary search trees
- traveling salesman problem
- phase transition
- graph coloring
- cluster of workstations
- shared memory
- parallel computation
- stationary policies
- optimal solution
- markov decision processes
- markov decision process
- dynamic programming
- linear program
- linear programming
- upper bound
- medial axis transform
- genetic algorithm