A PARALLEL MATCHING ALGORITHM FOR CONVEX BIPARTITE GRAPHS AND APPLICATIONS TO SCHEDULING

被引：33

作者：

DEKEL, E ^{[1
]}

SAHNI, S ^{[1
]}

机构：

[1] UNIV MINNESOTA,DEPT COMP SCI,MINNEAPOLIS,MN 55455

来源：

关键词：

D O I：

10.1016/0743-7315(84)90004-2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：185 / 205

页数：21

共 14 条

[1]

BOAS PV, 1977, INFORMATION PROCESSI, V6, P80

[2]

DEKEL E, 1983, IEEE T COMPUT, V32, P307, DOI 10.1109/TC.1983.1676223

[3] PARALLEL MATRIX AND GRAPH ALGORITHMS [J].

DEKEL, E ;

NASSIMI, D ;

SAHNI, S .

[4] PARALLEL SCHEDULING ALGORITHMS [J].

DEKEL, E ;

SAHNI, S .

[5] MAXIMUM MATCHING IN A CONVEX BIPARTITE GRAPH [J].

GLOVER, F .

NAVAL RESEARCH LOGISTICS QUARTERLY, 1967, 14 (03) :313-&

[6]

JACKSON JR, 1955, 43 U CAL RES REP

[7]

Kan A.R, 2012, Attention and Cognitive Development

[8]

LAGEWEG BJ, 1976, SEQUENCING ENUMERATI, P22

[9]

LIPSKI W, 1981, ACTA INFORM, V15, P329, DOI 10.1007/BF00264533

[10] SCHEDULING WITH DEADLINES AND LOSS FUNCTIONS [J].

MCNAUGHTON, R .