| Finding long cycles in graphs. | |
| | |
MedLine Citation:
|
PMID: 17677390 Owner: NLM Status: PubMed-not-MEDLINE |
Abstract/OtherAbstract:
|
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. |
| | |
Authors:
|
Enzo Marinari; Guilhem Semerjian; Valery Van Kerrebroeck |
Publication Detail:
|
Type: Journal Article Date: 2007-06-29 |
Journal Detail:
|
Title: Physical review. E, Statistical, nonlinear, and soft matter physics Volume: 75 ISSN: 1539-3755 ISO Abbreviation: Phys Rev E Stat Nonlin Soft Matter Phys Publication Date: 2007 Jun |
Date Detail:
|
Created Date: 2007-08-06 Completed Date: 2008-01-22 Revised Date: - |
Medline Journal Info:
|
Nlm Unique ID: 101136452 Medline TA: Phys Rev E Stat Nonlin Soft Matter Phys Country: United States |
Other Details:
|
Languages: eng Pagination: 066708 Citation Subset: - |
Affiliation:
|
Dipartimento di Fisica and INFN, Sapienza Università di Roma, P. A. Moro 2, 00185 Roma, Italy. |
Export Citation:
|
APA/MLA Format Download EndNote Download BibTex |
| MeSH Terms | |
Descriptor/Qualifier:
|
|
From MEDLINE®/PubMed®, a database of the U.S. National Library of Medicine
Previous Document: Modeling the flow of dense suspensions of deformable particles in three dimensions.
Next Document: Parameter identification of dynamical systems from time series.