THE COMPLEXITY OF COUNTING STABLE MARRIAGES

被引：134

作者：

IRVING, RW ^{[1
]}

LEATHER, P ^{[1
]}

机构：

[1] SALFORD COLL TECHNOL,DEPT COMP,SALFORD,ENGLAND

来源：

关键词：

D O I：

10.1137/0215048

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：655 / 667

页数：13

共 10 条

[1] COLLEGE ADMISSIONS AND STABILITY OF MARRIAGE
GALE, D
SHAPLEY, LS
[J]. AMERICAN MATHEMATICAL MONTHLY, 1962, 69 (01) : 9 - &
[2] Garey Michael R., 1979, COMPUTERS INTRACTABI
[3] IRVING RW, UNPUB J ALGORITHMS
[4] Knuth D., 1976, MARIAGES STABLES
[5] STABLE MARRIAGE PROBLEM
MCVITIE, DG
WILSON, LB
[J]. COMMUNICATIONS OF THE ACM, 1971, 14 (07) : 486 - &
[6] Polya George, 1983, NOTES INTRO COMBINAT
[7] THE COMPLEXITY OF COUNTING CUTS AND OF COMPUTING THE PROBABILITY THAT A GRAPH IS CONNECTED
PROVAN, JS
BALL, MO
[J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 777 - 788
[8] Valiant L. G., 1979, Theoretical Computer Science, V8, P189, DOI 10.1016/0304-3975(79)90044-6
[9] COMPLEXITY OF ENUMERATION AND RELIABILITY PROBLEMS
VALIANT, LG
[J]. SIAM JOURNAL ON COMPUTING, 1979, 8 (03) : 410 - 421
[10] WIRTH N, 1976, ALGORITHMS PLUS DATA