THE COMPLEXITY OF COUNTING STABLE MARRIAGES

被引：140

作者：

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 [J].

GALE, D ;

SHAPLEY, LS .

[2]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[3]

IRVING RW, UNPUB J ALGORITHMS

[4]

Knuth D., 1976, MARIAGES STABLES

[5] STABLE MARRIAGE PROBLEM [J].

MCVITIE, DG ;

WILSON, LB .

[6]

Polya George, 1983, NOTES INTRO COMBINAT

PROVAN, JS ;

BALL, MO .

[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 [J].

VALIANT, LG .

[10]

WIRTH N, 1976, ALGORITHMS PLUS DATA