POLYNOMIAL-TIME ALGORITHMS FOR THE MIN CUT PROBLEM ON DEGREE RESTRICTED TREES

被引：36

作者：

CHUNG, MJ

MAKEDON, F

SUDBOROUGH, IH

TURNER, J

机构：

[1] IIT, DEPT COMP SCI, CHICAGO, IL 60616 USA

[2] NORTHWESTERN UNIV, DEPT ELECT ENGN & COMP SCI, EVANSTON, IL 60201 USA

[3] BELL TEL LABS INC, MURRAY HILL, NJ 07974 USA

来源：

SIAM JOURNAL ON COMPUTING | 1985年 / 14卷 / 01期

关键词：

D O I：

10.1137/0214013

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

COMPUTER PROGRAMMING

引用

页码：158 / 177

页数：20

共 44 条

[21]

LOUI MC, 1979, MITLCSTM133 TECHN RE

[22]

MAKEDON FS, 1983, LECT NOTES COMPUT SC, V154, P478

[23]

MAKEDON FS, 1983, 8TH P C TREES ALG PR

[24]

MAKEDON FS, 1985, UNPUB SIAM J ALG DIS, V6

[25]

MEGIDDO N, 1981, UNPUB LINEAR TIME AL

[26]

MEGIDDO N, 1981, P IEEE F COMPUTER SC, P376

[27]

Meyer Auf Der Heide F., 1981, Theoretical Computer Science, V13, P315, DOI 10.1016/S0304-3975(81)80004-7

[28]

MONIEN B, 1981, 13TH P ANN ACM STOC, P207

[29]

MOON JW, 1970, CANADIAN MATH MONOGR, V1, P112

[30] ONE-DIMENSIONAL LOGIC GATE ASSIGNMENT AND INTERVAL GRAPHS [J].

OHTSUKI, T ;

MORI, H ;

KUH, ES ;

KASHIWABARA, T ;

FUJISAWA, T .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1979, 26 (09) :675-684

← 1 2 3 4 5 →