LINEAR-TIME COMPUTABILITY OF COMBINATORIAL PROBLEMS ON SERIES-PARALLEL GRAPHS

被引：198

作者：

TAKAMIZAWA, K ^{[1
]}

NISHIZEKI, T ^{[1
]}

SAITO, N ^{[1
]}

机构：

[1] TOHOKU UNIV, DEPT ELECT ENGN, SENDAI, MIYAGI 980, JAPAN

来源：

关键词：

D O I：

10.1145/322326.322328

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：623 / 641

页数：19

共 24 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

[Anonymous], 1956, J FRANKL INST

[3] POLYTOPE OF INDEPENDENT SETS OF SERIES-PARALLEL GRAPH [J].

BOULALA, M ;

UHRY, JP .

[4]

Chartrand G., 1971, J COMB THEORY B, V10, P12

[5] TOPOLOGY OF SERIES-PARALLEL NETWORKS [J].

DUFFIN, RJ .

[6] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

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

[7]

EVEN S, 1975, 16TH P ANN IEEE S F, P100

[8]

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

[9]

Hadlock F., 1975, SIAM Journal on Computing, V4, P221, DOI 10.1137/0204019

[10]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364