3 FAST ALGORITHMS FOR 4 PROBLEMS IN STABLE MARRIAGE

被引:96
作者
GUSFIELD, D [1 ]
机构
[1] YALE UNIV,DEPT COMP SCI,NEW HAVEN,CT 06520
关键词
D O I
10.1137/0216010
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:111 / 128
页数:18
相关论文
共 13 条
[1]  
GALE D, 1962, AM MATH MONTHLY, V69
[2]  
GALE D, IN PRESS DISCRETE AP
[3]  
GUSFIELD D, 1985, 407 YAL COMP SCI TEC
[4]  
IRVING R, 1985, EFFICIENT ALGORITHM
[5]   THE COMPLEXITY OF COUNTING STABLE MARRIAGES [J].
IRVING, RW ;
LEATHER, P .
SIAM JOURNAL ON COMPUTING, 1986, 15 (03) :655-667
[6]  
Knuth D. E., 1974, Information Processing Letters, V2, P153, DOI 10.1016/0020-0190(74)90001-5
[7]  
KNUTH DE, 1976, MARRIAGES STABLE
[8]  
LAWLER E, GENERATING ALL MAXIM
[9]  
Lawler E.L., 1976, COMBINATORIAL OPTIMI
[10]  
MCVITIE D, 1971, STABLE MARRIAGE PROB