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 条

[1]

BREUER MA, 1977, J DES AUTOM FAULT, V1, P343

[2]

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

[3]

CHUNG FRK, 1985, UNPUB SIAM J ALG DIS, V6

[4]

CHUNG FRK, 1980, TM80121631 BELL LAB

[5]

DOLEV D, 1982, IBM RJ3368 TECHN REP

[6]

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

[7]

FOSTER MJ, 1981, AUG VLSI 81 C

[8]

Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1

[9]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[10] COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION [J].

GAREY, MR ;

GRAHAM, RL ;

JOHNSON, DS ;

KNUTH, DE .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1978, 34 (03) :477-495

← 1 2 3 4 5 →