A POLYNOMIAL ALGORITHM FOR THE MIN-CUT LINEAR ARRANGEMENT OF TREES

被引：82

作者：

YANNAKAKIS, M

机构：

[1] AT&T Bell Lab, Murray Hill, NJ,, USA, AT&T Bell Lab, Murray Hill, NJ, USA

来源：

关键词：

D O I：

10.1145/4221.4228

中图分类号：

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

学科分类号：

0812 ;

摘要：

MATHEMATICAL TECHNIQUES

引用

页码：950 / 988

页数：39

共 27 条

[1]

BRENT RP, 1980, INFORM PROCESS LETT, V11, P44

[2]

Chung F. R. K., 1981, THEORY APPLICATIONS, P255

[3] ON OPTIMAL LINEAR ARRANGEMENTS OF TREES [J].

CHUNG, FRK .

[4]

CHUNG FRK, UNPUB SIAM J ALG DIS

[5]

CHUNG MJ, 1982, 23RD P ANN IEEE S F, P262

COOK, S ;

SETHI, R .

[7]

DOLEV D, 1982, IBM RJ3368 TECH REP

[8]

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

[9]

FISHER MJ, 1980, 12TH P ANN ACM S THE, P177

[10]

Foster M. J., 1981, VLSI 81. Very Large Scale Integration. Proceedings of the First International Conference on Very Large Scale Integration, P75