ON THE COMPUTATIONAL-COMPLEXITY OF THE MINIMUM-DUMMY-ACTIVITIES PROBLEM IN A PERT NETWORK

被引：9

作者：

SYSLO, MM ^{[1
]}

机构：

[1] WASHINGTON STATE UNIV,DEPT COMP SCI,PULLMAN,WA 99164

来源：

关键词：

D O I：

10.1002/net.3230140104

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：37 / 45

页数：9

共 12 条

[1]

Aho A. V., 1972, SIAM Journal on Computing, V1, P131, DOI 10.1137/0201008

[2]

CANTOR DG, 1969, J COMBINATORIAL THEO, V6, P165

[3] MINIMAL EVENT-NODE NETWORK OF PROJECT PRECEDENCE RELATIONS [J].

CORNEIL, DG ;

GOTLIEB, CC ;

LEE, YM .

[4]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[5]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[6]

Harary Frank, 1960, RENDIC CIRC MAT PALE, V9, P161, DOI DOI 10.1007/BF02854581

KRISHNAMOORTHY, MS ;

DEO, N .

[8]

LEE YM, 1971, THESIS U TORONTO

SYSLO, MM .

[10]

SYSLO MM, 1974, B ACAD POL SCI SMAP, V22, P5