EVERY FINITE DISTRIBUTIVE LATTICE IS A SET OF STABLE MATCHINGS FOR A SMALL STABLE MARRIAGE INSTANCE

被引：23

作者：

GUSFIELD, D

IRVING, R

LEATHER, P

SAKS, M

机构：

[1] UNIV GLASGOW,DEPT COMP SCI,GLASGOW G12 8QQ,SCOTLAND

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

[3] BELL COMMUN RES,MORRISTOWN,NJ

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES A | 1987年 / 44卷 / 02期

关键词：

D O I：

10.1016/0097-3165(87)90037-9

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：304 / 309

页数：6

共 10 条

[1]

Birkhoff G., 1967, LATTICE THEORY

[2] EVERY FINITE DISTRIBUTIVE LATTICE IS A SET OF STABLE MATCHINGS [J].

BLAIR, C .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1984, 37 (03) :353-356

[3] COLLEGE ADMISSIONS AND STABILITY OF MARRIAGE [J].

GALE, D ;

SHAPLEY, LS .

AMERICAN MATHEMATICAL MONTHLY, 1962, 69 (01) :9-&

[4]

Gratzer G., 1979, LATTICE THEORY

[5]

GUSFIELD D, 1986, 482 YAL U COMP SCI T

[6]

GUSFIELD D, 1985, 407 YAL U COMP SCI T

[7]

GUSFIELD D, IN PRESS SIAM J COMP

[8]

IRVING R, 1985, EFFICIENT ALGORITHM

[9] THE COMPLEXITY OF COUNTING STABLE MARRIAGES [J].

IRVING, RW ;

LEATHER, P .

SIAM JOURNAL ON COMPUTING, 1986, 15 (03) :655-667

[10]

Knuth D. E, 1976, MARRIAGES STABLES

← 1 →