GENERATING RANDOM SPANNING-TREES

被引：164
作者：
BRODER, A
机构：
来源：
30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE | 1989年
关键词：
D O I：
10.1109/SFCS.1989.63516
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：442 / 447
页数：6
相关论文
共 50 条
[41]   INTERPOLATION THEOREM FOR DIAMETERS OF SPANNING-TREES [J].
HARARY, F ;
MOKKEN, RJ ;
PLANTHOLT, MJ .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1983, 30 (07) :429-432
[42]   SPANNING-TREES FIXED BY AUTOMORPHISMS OF A GRAPH [J].
KANO, M ;
SAKAMOTO, A .
DISCRETE MATHEMATICS, 1990, 82 (02) :219-222
[43]   GRAPHS WITH NOT TOO MANY SPANNING-TREES [J].
DING, GL .
NETWORKS, 1995, 25 (04) :193-197
[44]   THE NUMBER OF SPANNING-TREES OF THE REGULAR NETWORKS [J].
YANG, CS ;
WANG, JF ;
LEE, JY ;
BOESCH, FT .
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 23 (3-4) :185-200
[45]   NATURAL SPANNING-TREES OF ZD ARE RECURRENT [J].
GERL, P .
DISCRETE MATHEMATICS, 1986, 61 (2-3) :333-336
[46]   ON FINDING MOST UNIFORM SPANNING-TREES [J].
GALIL, Z ;
SCHIEBER, B .
DISCRETE APPLIED MATHEMATICS, 1988, 20 (02) :173-175
[47]   TOPOLOGICAL COMPLEXITY OF GRAPHS AND THEIR SPANNING-TREES [J].
NAHUM, R ;
ZAFRANY, S .
ACTA MATHEMATICA HUNGARICA, 1995, 66 (1-2) :1-10
[48]   ON SPANNING-TREES WITH LOW CROSSING NUMBERS [J].
WELZL, E .
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 594 :233-249
[49]   SPANNING-TREES OF INFINITE-GRAPHS [J].
POLAT, N .
CZECHOSLOVAK MATHEMATICAL JOURNAL, 1991, 41 (01) :52-60
[50]   ON CONSTRUCTING MULTIPLE SPANNING-TREES IN A HYPERCUBE [J].
WANG, FH ;
LIN, FC .
INFORMATION PROCESSING LETTERS, 1993, 45 (04) :177-183
12345