Parallel algorithm for finding the most vital edge in weighted graphs

被引：2
|
作者：
Banerjee, S [1 ]
Saxena, S [1 ]
机构：
[1] Indian Inst Technol, Kanpur 208016, Uttar Pradesh, India
来源：
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1997年 / 46卷 / 01期
关键词：
D O I：
10.1006/jpdc.1997.1383
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Let G = (V, E) be a weighted undirected graph with n vertices and m edges; each edge e has a weight w(e) assigned to it. Let f(G) be the weight of a minimum spanning tree of G if G is connected; otherwise f(G) = infinity. The most vital edge of G is an edge e such that f(G - e) greater than or equal to f(G - e') for every other edge e' of G, In this paper we describe an O(log n) time parallel algorithm with in processors for finding the most vital edge of a graph on the concurrent read exclusive write (CREW) model of parallel computation. (C) 1997 Academic Press.
引用
收藏
页码：101 / 104
页数：4
相关论文
共 50 条
  • [1] FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS
    HSU, LH
    JAN, RH
    LEE, YC
    HUNG, CN
    CHERN, MS
    INFORMATION PROCESSING LETTERS, 1991, 39 (05) : 277 - 281
  • [2] PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
    HSU, LH
    WANG, PF
    WU, CT
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1992, 12 : 284 - 290
  • [3] PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
    HSU, LH
    WANG, PF
    WU, CT
    PARALLEL COMPUTING, 1992, 18 (10) : 1143 - 1155
  • [4] An Algorithm for Finding the Most Similar Given Sized Subgraphs in Two Weighted Graphs
    Yang, Xu
    Qiao, Hong
    Liu, Zhi-Yong
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2018, 29 (07) : 3295 - 3300
  • [5] AN OPTIMAL ALGORITHM FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO SKT RELIABILITY IN BSP DIGRAPHS
    WANG, PF
    LEU, SC
    HSU, LH
    JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 1995, 18 (04) : 519 - 529
  • [6] Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree
    Shen, H
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 1705 - 1710
  • [7] Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree
    Shen, H
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2000, 75 (02) : 129 - 136
  • [8] Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree
    Shen, H
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 795 - 800
  • [9] FINDING THE MOST VITAL EDGE WITH RESPECT TO K-TERMINAL RELIABILITY IN SERIES-PARALLEL NETWORKS
    WANG, PF
    HSU, LH
    COMPUTERS & INDUSTRIAL ENGINEERING, 1993, 25 (1-4) : 457 - 460
  • [10] An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs
    Sunder, S
    He, X
    ALGORITHMICA, 1996, 16 (03) : 243 - 262
12345