Finding long cycles in graphs

Simple item page
dc.creatorMarinari, Enzo
dc.creatorSemerjian, Guilhem
dc.creatorVan Kerrebroeck, Valery
dc.date2007-02-26
dc.date.accessioned2026-07-07T08:13:37Z
dc.date.available2026-07-07T08:13:37Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cond-mat/0702613
dc.identifierhttp://arxiv.org/abs/cond-mat/0702613
dc.identifierPhys. Rev. E 75, 066708 (2007)
dc.identifierdoi:10.1103/PhysRevE.75.066708
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132829
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.subjectComputational Complexity
dc.subjectProbability
dc.titleFinding long cycles in graphs
dc.typetext

Files

Collections

arXiv