FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS

被引：36

作者：

HSU, LH ^{[1
]}

JAN, RH ^{[1
]}

LEE, YC ^{[1
]}

HUNG, CN ^{[1
]}

CHERN, MS ^{[1
]}

机构：

[1] NATL TSING HUA UNIV,DEPT IND ENGN,HSINCHU 30043,TAIWAN

来源：

关键词：

DATA STRUCTURES; DESIGN OF ALGORITHMS; MINIMUM SPANNING TREES;

D O I：

10.1016/0020-0190(91)90028-G

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：277 / 281

页数：5

共 6 条

[1] FINDING THE MOST VITAL ARCS IN A NETWORK [J].

BALL, MO ;

GOLDEN, BL ;

VOHRA, RV .

[2]

Corley H. W., 1982, Operations Research Letters, V1, P157, DOI 10.1016/0167-6377(82)90020-7

[3]

Gould Ronald, 1988, GRAPH THEORY, pppl9X

[4]

Joseph J., 1956, P AM MATH SOC, V7, P48, DOI [DOI 10.1090/S0002-9939-1956-0078686-7, 10.2307/2033241]

[5]

PRIM RC, 1957, BELL SYST TECH J, V36, P389

[6] EFFICIENCY OF A GOOD BUT NOT LINEAR SET UNION ALGORITHM [J].

TARJAN, RE .