COUNTING THE NUMBER OF HAMILTON CYCLES IN RANDOM DIGRAPHS

被引：11
|
作者：
FRIEZE, A
SUEN, S
机构：
[1] Department of Mathematics, Carnegie Mellon University, Pittsburgh, Pennsylvania
来源：
RANDOM STRUCTURES & ALGORITHMS | 1992年 / 3卷 / 03期
关键词：
D O I：
10.1002/rsa.3240030303
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We show that there exists a a fully polynomial randomized approximation scheme for counting the number of Hamilton cycles in almost all directed graphs.
引用
收藏
页码：235 / 241
页数：7
相关论文
共 50 条
  • [1] Packing and counting arbitrary Hamilton cycles in random digraphs
    Ferber, Asaf
    Long, Eoin
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2019, 54 (03) : 499 - 514
  • [2] ON THE NUMBER OF HAMILTON CYCLES IN A RANDOM GRAPH
    COOPER, C
    FRIEZE, AM
    [J]. JOURNAL OF GRAPH THEORY, 1989, 13 (06) : 719 - 735
  • [3] Hamilton cycles in circulant digraphs with prescribed number of distinct jumps
    Bogdanowicz, Zbigniew R.
    [J]. DISCRETE MATHEMATICS, 2009, 309 (08) : 2100 - 2107
  • [4] Counting Hamilton cycles in sparse random directed graphs
    Ferber, Asaf
    Kwan, Matthew
    Sudakov, Benny
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2018, 53 (04) : 592 - 603
  • [5] Generating and counting Hamilton cycles in random regular graphs
    Frieze, A
    Jerrum, M
    Molloy, M
    Robinson, R
    Wormald, N
    [J]. JOURNAL OF ALGORITHMS, 1996, 21 (01) : 176 - 198
  • [6] ON THE NUMBER OF HAMILTON CYCLES IN SPARSE RANDOM GRAPHS
    Glebov, Roman
    Krivelevich, Michael
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (01) : 27 - 42
  • [7] ORIENTED HAMILTON CYCLES IN DIGRAPHS
    HAGGKVIST, R
    THOMASON, A
    [J]. JOURNAL OF GRAPH THEORY, 1995, 19 (04) : 471 - 479
  • [8] Packing, counting and covering Hamilton cycles in random directed graphs
    Asaf Ferber
    Gal Kronenberg
    Eoin Long
    [J]. Israel Journal of Mathematics, 2017, 220 : 57 - 87
  • [9] Packing, counting and covering Hamilton cycles in random directed graphs
    Ferber, Asaf
    Kronenberg, Gal
    Long, Eoin
    [J]. ISRAEL JOURNAL OF MATHEMATICS, 2017, 220 (01) : 57 - 87
  • [10] On the number of Hamilton cycles in pseudo-random graphs
    Krivelevich, Michael
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (01):
12345