FINDING THE MOST VITAL EDGE WITH RESPECT TO K-TERMINAL RELIABILITY IN SERIES-PARALLEL NETWORKS

dc.citation.epage	460	en_US
dc.citation.issue	1-4	en_US
dc.citation.spage	457	en_US
dc.citation.volume	25	en_US
dc.citation.woscount	1
dc.contributor.author	WANG, PF	en_US
dc.contributor.author	HSU, LH	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.date.accessioned	2014-12-08T15:04:24Z
dc.date.available	2014-12-08T15:04:24Z
dc.date.issued	1993-09-01	en_US
dc.description.abstract	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.	en_US
dc.identifier.issn	0360-8352	en_US
dc.identifier.journal	COMPUTERS & INDUSTRIAL ENGINEERING	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/2892
dc.identifier.wosnumber	WOS:A1993LZ69500114
dc.language.iso	en_US	en_US
dc.subject	ANALYSIS OF ALGORITHMS	en_US
dc.subject	DATA STRUCTURES	en_US
dc.subject	NETWORKS GRAPHS	en_US
dc.subject	TREE ALGORITHMS	en_US
dc.subject	RELIABILITY	en_US
dc.subject	SYSTEM SAFETY	en_US
dc.title	FINDING THE MOST VITAL EDGE WITH RESPECT TO K-TERMINAL RELIABILITY IN SERIES-PARALLEL NETWORKS	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1