Finding long cycles in graphs

被引：15
|
作者：
Marinari, Enzo
Semerjian, Guilhem
Van Kerrebroeck, Valery
机构：
[1] Univ Roma La Sapienza, Ist Nazl Fis Nucl, Dipartimento Fis, I-00185 Rome, Italy
[2] Univ Paris 06, CNRS, UMR 8549, Unite Mixte Rech, F-75231 Paris, France
来源：
PHYSICAL REVIEW E | 2007年 / 75卷 / 06期
关键词：
D O I：
10.1103/PhysRevE.75.066708
中图分类号：
O35 [流体力学]; O53 [等离子体物理学];
学科分类号：
070204 ; 080103 ; 080704 ;
摘要：
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.
引用
收藏
页数：10
相关论文
共 50 条
  • [1] Finding Large Cycles in Hamiltonian Graphs
    Feder, Tomas
    Motwani, Rajeev
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 166 - 175
  • [2] Finding large cycles in Hamiltonian graphs
    Feder, Tomas
    Motwani, Rajeev
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (08) : 882 - 893
  • [3] On Finding Hamiltonian Cycles in Barnette Graphs
    Bagheri, Behrooz Gh
    Fleischner, Herbert
    Feder, Tomas
    Subi, Carlos
    FUNDAMENTA INFORMATICAE, 2022, 188 (01) : 1 - 14
  • [4] Algorithms for Finding Diameter Cycles of Biconnected Graphs
    Karaata M.H.
    Journal of Computing and Information Technology, 2020, 28 (04) : 225 - 240
  • [5] FINDING CYCLES WITH TOPOLOGICAL PROPERTIES IN EMBEDDED GRAPHS
    Cabello, Sergio
    de Verdiere, Eric Colin
    Lazarus, Francis
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (04) : 1600 - 1614
  • [6] FINDING HAMILTONIAN CYCLES IN CERTAIN PLANAR GRAPHS
    CIMIKOWSKI, RJ
    INFORMATION PROCESSING LETTERS, 1990, 35 (05) : 249 - 254
  • [7] FINDING MINIMUM DOMINATING CYCLES IN PERMUTATION GRAPHS
    COLBOURN, CJ
    KEIL, JM
    STEWART, LK
    OPERATIONS RESEARCH LETTERS, 1985, 4 (01) : 13 - 17
  • [8] Finding Hamilton cycles in random intersection graphs
    Rybarczyk, Katarzyna
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2018, 20 (01):
  • [9] FINDING HAMILTON CYCLES IN SPARSE RANDOM GRAPHS
    FRIEZE, AM
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1988, 44 (02) : 230 - 250
  • [10] Parallel algorithms for finding cycles in undirected graphs
    Ma, Jun
    Kazuo, Iwama
    Ma, Shaohan
    Ruan Jian Xue Bao/Journal of Software, 1997, 8 (06): : 475 - 480
12345