PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE

被引：0

作者：

HSU, LH ^{[1
]}

WANG, PF ^{[1
]}

WU, CT ^{[1
]}

机构：

[1] NATL TSING HUA UNIV, INST IND ENGN, HSINCHU 300, TAIWAN

来源：

IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY | 1992年 / 12卷

关键词：

NONNUMERICAL ALGORITHMS AND PROBLEMS; GRAPH THEORY;

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

The weight of a weighted graph G, w(G), is defined to be the weight of its minimum spanning tree. An edge e is called a most vital edge in G if w(G - e) greater-than-or-equal-to w(G - e') for every edge e' of G. In this paper, we present several cost-optimal parallel algorithms, under different computation models, to find the most vital edge in a weighted graph.

引用

页码：284 / 290

页数：7

共 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] 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
[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, : 795 - 800
[4] 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
[5] 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
[6] FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS
HSU, LH
JAN, RH
LEE, YC
HUNG, CN
CHERN, MS
[J]. INFORMATION PROCESSING LETTERS, 1991, 39 (05) : 277 - 281
[7] Finding the k most vital edges with respect to minimum spanning tree
Hong Shen
[J]. Acta Informatica, 1999, 36 : 405 - 424
[8] Finding the k most vital edges with respect to minimum spanning tree
Shen, H
[J]. ACTA INFORMATICA, 1999, 36 (05) : 405 - 424
[9] 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
[10] Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem
Bazgan, Cristina
Toubaline, Sonia
Vanderpooten, Daniel
[J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, 6831 : 126 - 140

← 1 2 3 4 5 →