UPPER AND LOWER BOUNDS ON THE COMPLEXITY OF THE MIN-CUT LINEAR ARRANGEMENT PROBLEM ON TREES

被引：39

作者：

LENGAUER, T

机构：

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1982年 / 3卷 / 01期

关键词：

D O I：

10.1137/0603010

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：99 / 113

页数：15

共 11 条

[1]

CHUNG FRK, 1980, LINEAR ARRANGEMENTS

[2]

FELLER A, 1976, 13TH P DES AUT C, P79

[3]

Gacril F., 1977, 11TH P C INF SCI SYS, P91

[4]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[5] OPTIMAL ASSIGNMENTS OF NUMBERS TO VERTICES [J].

HARPER, LH .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1964, 12 (01) :131-135

[6]

LENGAUER T, INFORM PROCESS LETT, V10, P184

[7]

LENGAUER T, 1980, UNPUB ACTA INFORMATI

[8]

LOUI MC, 1979, LCS133 MIT REP

[9]

MEYER F, 1978, COMP 2 VARIATIONS PE

[10]

Persky G., 1977, Journal of Design Automation & Fault-Tolerant Computing, V1, P217