<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2004-02-16 16:47:53Computational complexity theory Message Passing Interface Speedup Algorithm Hamiltonian path Time complexity Bulk synchronous parallel Parallel algorithm Parallel Random Access Machine Theoretical computer science Parallel computing Computing |
|
Finding Hamiltonian Paths in Tournaments on Clusters - A Provably Communication-Efficient Approach Chun-Hsi Huang Xin He