標題: PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
作者: HSU, LH
WANG, PF
WU, CT
資訊工程學系
Department of Computer Science
關鍵字: WEIGHTED GRAPHS;MINIMUM SPANNING TREE;COMPUTATION MODELS;VITAL EDGE;COST-OPTIMAL PARALLEL ALGORITHMS
公開日期: 1992
摘要: Given a weighted graph G, the weight of a spanning tree T, denoted by w(T), is defined as the total weight of all edges in T. A spanning tree T in G is called a minimum spanning tree if w(T) less-than-or-equal-to w(T') for all spanning trees T' in G. Let w(G) denote the weight of the minimum spanning tree of G if G is connected; otherwise, w(G) = infinity. 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 where G - e' denotes the partial graph obtained by removing e' from 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.
URI: http://hdl.handle.net/11536/3286
ISSN: 0167-8191
期刊: PARALLEL COMPUTING
Volume: 18
Issue: 10
起始頁: 1143
結束頁: 1155
顯示於類別:期刊論文