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

Chun-Hsi Huang, Xin He. Finding a hamiltonian paths in tournaments on clusters - a provably communication-efficient approach. In Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), March 11-14, 2001, Las Vegas, NV, USA. pages 549-553, ACM, 2001. [doi]

Abstract

Abstract is missing.