Result: A Distributed Algorithm to Find Hamiltonian Cycles in G(n,p) Random Graphs

Title:
A Distributed Algorithm to Find Hamiltonian Cycles in G(n,p) Random Graphs
First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004 : revised selected papers
Authors:
Levy, E., Louchard, G., Petit, J.
Source:
LECTURE NOTES IN COMPUTER SCIENCE. (3403):63-74
Availability:
http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCCN056477080&indx=1&recIds=ETOCCN056477080
Database:
British Library Document Supply Centre Inside Serials & Conference Proceedings