Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament

Authors:
Danny Soroker
Affiliations:
Univ. of California, Berkeley
Venue:
Journal of Algorithms
Year:
1988

Citing 0
Cited 3

Finding a Hamiltonian paths in tournaments on clusters - a provably communication-efficient approach

Proceedings of the 2001 ACM symposium on Applied computing
Grid-enabled parallel divide-and-conquer: theory and practice

Proceedings of the 2002 ACM symposium on Applied computing
On Cost-Optimal Merge of Two Intransitive Sorted Sequences

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract