A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs

Eythan Levy, Guy Louchard, Jordi Petit. A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs. In Alejandro López-Ortiz, Angèle M. Hamel, editors, Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers. Volume 3405 of Lecture Notes in Computer Science, pages 63-74, Springer, 2004. [doi]

Abstract

Abstract is missing.