Finding long cycles in graphs
<|reference_start|>Finding long cycles in graphs: We analyze the problem of discovering long cycles inside a graph. We propose and test two algorithms for this task. The first one is based on recent advances in statistical mechanics and relies on a message passing procedure. The second follows a more standard Monte Carlo Markov Chain strategy. Special attention is devoted to Hamiltonian cycles of (non-regular) random graphs of minimal connectivity equal to three.<|reference_end|>
@article{marinari2007finding,
    title={Finding long cycles in graphs},
    author={Enzo Marinari, Guilhem Semerjian and Valery Van Kerrebroeck},
    journal={Phys. Rev. E 75, 066708 (2007)},
    year={2007},
    doi={10.1103/PhysRevE.75.066708},
    archivePrefix={arXiv},
    eprint={cond-mat/0702613},
    primaryClass={cond-mat.stat-mech cond-mat.dis-nn cs.CC math.PR}
}