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

Authors:
Chun-Hsi Huang;Xin He
Affiliations:
Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY;Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY
Venue:
Proceedings of the 2001 ACM symposium on Applied computing
Year:
2001

Citing 10
Cited 1

Optimal parallel algorithms for computing convex hulls and for sortng

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

Journal of Algorithms
Efficient parallel algorithms

Efficient parallel algorithms
A bridging model for parallel computation

Communications of the ACM
Parallel numerical algorithms

Parallel numerical algorithms
Scalable parallel geometric algorithms for coarse grained multicomputers

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Communication-efficient parallel sorting (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Parallel programming with MPI

Parallel programming with MPI
Synthesis of Parallel Algorithms

Synthesis of Parallel Algorithms
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems

Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems

Grid-enabled parallel divide-and-conquer: theory and practice

Proceedings of the 2002 ACM symposium on Applied computing

Quantified Score

Hi-index	0.00

Visualization

Abstract