COUNTING THE NUMBER OF HAMILTON CYCLES IN RANDOM DIGRAPHS

被引:11
|
作者
FRIEZE, A
SUEN, S
机构
[1] Department of Mathematics, Carnegie Mellon University, Pittsburgh, Pennsylvania
关键词
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 条