AN EFFICIENTLY SOLVABLE CASE OF THE MINIMUM WEIGHT EQUIVALENT SUBGRAPH PROBLEM

被引：11

作者：

RICHEY, MB ^{[1
]}

PARKER, RG ^{[1
]}

RARDIN, RL ^{[1
]}

机构：

[1] PURDUE UNIV, DEPT IND ENGN, W LAFAYETTE, IN 47907 USA

来源：

关键词：

D O I：

10.1002/net.3230150207

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：217 / 228

页数：12

共 12 条

[1]

Dirac Gabriel A., 1952, J LOND MATH SOC, V27, P85, DOI 10.1112/jlms/s1-27.1.85

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

DUFFIN, RJ .

[3]

HSU HT, 1975, NETWORKS, V12, P89

[4]

LIU PC, 1980, 11TH P SE C COMB GRA, P597

[5] FINDING A MINIMUM EQUIVALENT GRAPH OF A DIGRAPH [J].

MARTELLO, S ;

TOTH, P .

[6] AN ALGORITHM FOR FINDING A MINIMUM EQUIVALENT GRAPH OF A DIGRAPH [J].

MOYLES, DM ;

THOMPSON, GL .

[7]

RARDIN RL, 1982, DEFINITIONS PROPERTI

[8]

RARDIN RL, ISYE REPORT SERIES J, V825

[9]

RICHEY MB, ISYE REPORT SERIES J, V8211

[10]

Sahni S., 1974, SIAM Journal on Computing, V3, P262, DOI 10.1137/0203021