AN ALGORITHM FOR FINDING HAMILTON CYCLES IN RANDOM DIRECTED-GRAPHS

被引:31
|
作者
FRIEZE, AM [1 ]
机构
[1] UNIV LONDON QUEEN MARY COLL,DEPT COMP SCI & STAT,LONDON E1 4NS,ENGLAND
关键词
D O I
10.1016/0196-6774(88)90037-5
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:181 / 204
页数:24
相关论文
共 50 条
  • [21] Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
    Nenadov, Rajko
    Skoric, Nemanja
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2019, 54 (01) : 187 - 208
  • [22] DISJOINT CYCLES IN DIRECTED-GRAPHS ON THE TORUS AND THE KLEIN BOTTLE
    DING, GL
    SCHRIJVER, A
    SEYMOUR, PD
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1993, 58 (01) : 40 - 45
  • [23] A survey on Hamilton cycles in directed graphs
    Kuehn, Daniela
    Osthus, Deryk
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (05) : 750 - 766
  • [24] THE EFFECT OF 2 CYCLES ON THE COMPLEXITY OF COLOURINGS BY DIRECTED-GRAPHS
    BANGJENSEN, J
    HELL, P
    [J]. DISCRETE APPLIED MATHEMATICS, 1990, 26 (01) : 1 - 23
  • [25] AN OPTIMAL ALGORITHM FOR CYCLE BREAKING IN DIRECTED-GRAPHS
    ORENSTEIN, T
    KOHAVI, Z
    POMERANZ, I
    [J]. JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 1995, 7 (1-2): : 71 - 81
  • [26] COLORFUL HAMILTON CYCLES IN RANDOM GRAPHS
    Chakraborti, Debsoumya
    Frieze, Alan M.
    Hasabnis, Mihir
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (01) : 51 - 64
  • [27] HAMILTON CYCLES IN RANDOM GEOMETRIC GRAPHS
    Balogh, Jozsef
    Bollobas, Bela
    Krivelevich, Michael
    Muller, Tobias
    Walters, Mark
    [J]. ANNALS OF APPLIED PROBABILITY, 2011, 21 (03): : 1053 - 1072
  • [28] An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
    Frieze, Alan
    Haber, Simi
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (01) : 73 - 98
  • [29] Rainbow hamilton cycles in random graphs
    Frieze, Alan
    Loh, Po-Shen
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2014, 44 (03) : 328 - 354
  • [30] PANCYCLIC HAMILTON CYCLES IN RANDOM GRAPHS
    COOPER, C
    [J]. DISCRETE MATHEMATICS, 1991, 91 (02) : 141 - 148