An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs.
Martin FürerBalaji RaghavachariPublished in: J. Algorithms (1995)
Keyphrases
- parallel algorithm
- directed graph
- strongly connected
- random walk
- parallel computation
- shared memory
- cluster of workstations
- parallel programming
- directed acyclic graph
- undirected graph
- graph structures
- discovery of association rules
- graph structure
- markov chain
- parallel implementations
- binary search trees
- parallel version
- disjoint paths
- database systems