MINIMIZING SETUPS IN ORDERED SETS OF FIXED WIDTH

被引：31

作者：

COLBOURN, CJ

PULLEYBLANK, WR

机构：

[1] UNIV WATERLOO,DEPT COMP SCI,WATERLOO N2L 3G1,ONTARIO,CANADA

[2] UNIV WATERLOO,DEPT COMBINATORIES & OPTIMIZAT,WATERLOO N2L 3G1,ONTARIO,CANADA

来源：

ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS | 1985年 / 1卷 / 03期

关键词：

D O I：

10.1007/BF00383598

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：225 / 229

页数：5

共 8 条

[1] JUMP NUMBER OF DAGS HAVING DILWORTH NUMBER-2 [J].

CHEIN, M ;

HABIB, M .

[2] MINIMIZING SETUPS FOR CYCLE-FREE ORDERED SETS [J].

DUFFUS, D ;

RIVAL, I ;

WINKLER, P .

[3]

FAIGLE U, 1984, 84316OR U BONN REP

[4] COMPLEXITY OF SCHEDULING UNDER PRECEDENCE CONSTRAINTS [J].

LENSTRA, JK ;

RINNOOYKAN, AHG .

[5]

PULLEYBLANK WR, 1982, UNPUB DISC APPL MATH

[6]

PULLEYBLANK WR, 1982, CORR8218 U WAT DEP C

SYSLO, MM .

ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1984, 1 (01) :7-19

[8]

SYSLO MM, 1985, UNPUB GRAPHS ORDER