Work

Finding long cycles in graphs

Year: 2007

Type: article

Abstract: 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 (nonregular) random graphs of minimal connectivity equal to 3.

Source: Physical Review E

DOI: 10.1103/physreve.75.066708

Authors: Enzo Marinari, Guilhem Semerjian, Valery Van Kerrebroeck

Institutions: Sapienza University of Rome, Centre National de la Recherche Scientifique, Université Pierre-et-Marie-Curie

Language: English

Topic: Complex Network Analysis Techniques

Subfield: Statistical and Nonlinear Physics

Field: Physics and Astronomy

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1963712368

FWCI: 1.962

Cites: 39

Cited by: 19

Related to: 10