標題: FINDING THE MOST VITAL EDGE WITH RESPECT TO K-TERMINAL RELIABILITY IN SERIES-PARALLEL NETWORKS
作者: WANG, PF
HSU, LH
資訊工程學系
Department of Computer Science
關鍵字: ANALYSIS OF ALGORITHMS;DATA STRUCTURES;NETWORKS GRAPHS;TREE ALGORITHMS;RELIABILITY;SYSTEM SAFETY
公開日期: 1-Sep-1993
摘要: Let K be contained in the vertex-set of a graph G. ''The most vital edge'' is the edge whose deletion yields the largest decrease in the K-terminal reliability, that is the probability that all vertices in K are connected. In this paper, we present a linear-time algorithm for finding the most vital edge with respect to K-terminal reliability in series-parallel networks.
URI: http://hdl.handle.net/11536/2892
ISSN: 0360-8352
期刊: COMPUTERS & INDUSTRIAL ENGINEERING
Volume: 25
Issue: 1-4
起始頁: 457
結束頁: 460
Appears in Collections:Articles