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

被引：35

作者：

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

来源：

INFORMATION PROCESSING LETTERS | 1991年 / 39卷 / 05期

关键词：

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

共 50 条

[1] PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
HSU, LH
WANG, PF
WU, CT
[J]. PARALLEL COMPUTING, 1992, 18 (10) : 1143 - 1155
[2] PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
HSU, LH
WANG, PF
WU, CT
[J]. IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1992, 12 : 284 - 290
[3] Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree
Shen, H
[J]. INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 1705 - 1710
[4] Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree
Shen, H
[J]. INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 795 - 800
[5] Finding the k most vital edges with respect to minimum spanning tree
Hong Shen
[J]. Acta Informatica, 1999, 36 : 405 - 424
[6] Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree
Shen, H
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2000, 75 (02) : 129 - 136
[7] Finding the k most vital edges with respect to minimum spanning tree
Shen, H
[J]. ACTA INFORMATICA, 1999, 36 (05) : 405 - 424
[8] Finding the k most vital edges with respect to minimum spanning tree
Shen, H
[J]. PROCEEDINGS OF THE IEEE 1997 AEROSPACE AND ELECTRONICS CONFERENCE - NAECON 1997, VOLS 1 AND 2, 1997, : 255 - 262
[9] EFFICIENT ALGORITHMS FOR FINDING THE MOST VITAL EDGE OF A MINIMUM SPANNING TREE
IWANO, K
KATOH, N
[J]. INFORMATION PROCESSING LETTERS, 1993, 48 (05) : 211 - 213
[10] Finding the k most vital edges in the minimum spanning tree problem
Liang, WF
Shen, XJ
[J]. PARALLEL COMPUTING, 1997, 23 (13) : 1889 - 1907

← 1 2 3 4 5 →