ON THE COMPLEXITY OF PARTITIONING GRAPHS INTO CONNECTED SUBGRAPHS

被引：105

作者：

DYER, ME ^{[1
]}

FRIEZE, AM ^{[1
]}

机构：

[1] CARNEGIE MELLON UNIV,GRAD SCH IND ADM,PITTSBURGH,PA 15213

来源：

关键词：

D O I：

10.1016/0166-218X(85)90008-3

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：139 / 153

页数：15

共 17 条

[1]

[Anonymous], 1973, Transient Flows in Networks, Computers and intractability

[2]

DYER ME, UNPUB PLANAR 3DM IS

[3] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[4]

GYORI E, 1976, C MATH SOC JANOS BOL, V18

[5]

HADLOCK F, 1974, 5TH P SE C COMB GRAP, P449

[6] THE NP-COMPLETENESS OF SOME EDGE-PARTITION PROBLEMS [J].

HOLYER, I .

[7]

JUNGER M, 1983, CORR838 U WAT RES

[8]

Karp RM, 1972, REDUCIBILITY COMBINA, P85, DOI [DOI 10.1007/978-1-4684-2001-2_9, 10.1007/978-3-540-68279-0-8]

[9]

Kirkpatrick D.G., 1978, 10TH P ANN ACM S THE, P240

[10] PLANAR FORMULAS AND THEIR USES [J].

LICHTENSTEIN, D .