PROFILE SCHEDULING OF OPPOSING FORESTS AND LEVEL ORDERS

被引：29

作者：

DOLEV, D

WARMUTH, MK

机构：

[1] IBM CORP,RES LAB,SAN JOSE,CA 95193

[2] UNIV CALIF SANTA CRUZ,DEPT COMP SCI,SANTA CRUZ,CA 95064

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1985年 / 6卷 / 04期

关键词：

D O I：

10.1137/0606066

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：665 / 687

页数：23

共 20 条

[1]

Aho A. V., 1974, The design and analysis of computer algorithms

[2]

BRUNO J, 1981, JUL NATO C DURH

[3]

Coffman E.G., 1976, Computer and Job-Shop Scheduling Theory

[4]

Coffman E. G. Jr., 1972, Acta Informatica, V1, P200, DOI 10.1007/BF00288685

[5] SCHEDULING PRECEDENCE GRAPHS OF BOUNDED HEIGHT [J].

DOLEV, D ;

WARMUTH, MK .

JOURNAL OF ALGORITHMS, 1984, 5 (01) :48-59

[6]

DOLEV D, 1984, 8404 HEBR U RES REP

[7] CORRECTION [J].

FUJII, M .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 20 (01) :141-&

[8] OPTIMAL SEQUENCING OF 2 EQUIVALENT PROCESSORS [J].

FUJII, M ;

KASAMI, T ;

NINOMIYA, K .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (04) :784-&

[9] A LINEAR-TIME RECOGNITION ALGORITHM FOR INTERVAL DAGS [J].

GABOW, HN .

INFORMATION PROCESSING LETTERS, 1981, 12 (01) :20-22

[10] AN ALMOST-LINEAR ALGORITHM FOR 2-PROCESSOR SCHEDULING [J].

GABOW, HN .

JOURNAL OF THE ACM, 1982, 29 (03) :766-780

← 1 2 →