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]
@inproceedings{LevyLP04,
title = {A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs},
author = {Eythan Levy and Guy Louchard and Jordi Petit},
year = {2004},
doi = {10.1007/11527954_7},
url = {http://dx.doi.org/10.1007/11527954_7},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/LevyLP04},
cites = {0},
citedby = {0},
pages = {63-74},
booktitle = {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},
editor = {Alejandro López-Ortiz and Angèle M. Hamel},
volume = {3405},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-27873-7},
}