FAST PROBABILISTIC ALGORITHMS FOR HAMILTONIAN CIRCUITS AND MATCHINGS

被引：308

作者：

ANGLUIN, D

VALIANT, LG

机构：

来源：

关键词：

D O I：

10.1016/0022-0000(79)90045-X

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：155 / 193

页数：39

共 29 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER

[2]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[3]

Cook S. A., 1973, Journal of Computer and System Sciences, V7, P354, DOI 10.1016/S0022-0000(73)80029-7

[4]

Dirac G. A., 1952, P LOND MATH SOC, V2, P69, DOI DOI 10.1112/PLMS/S3-2.1.69

[5] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[6] ON EXISTENCE OF A FACTOR OF DEGREE 1 OF A CONNECTED RANDOM GRAPH [J].

ERDOS, P ;

RENYI, A .

ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1966, 17 (3-4) :359-+

[7]

Erdos P., 1974, PROBABILISTIC METHOD

[8]

ERDOS P., 1959, PUBL MATH-DEBRECEN, V6, P290

[9]

EVEN S, 1975, 16TH P ANN IEEE S F, P100

[10]

Feller, 1968, INTRO PROBABILITY TH