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

Full metadata record

DC Field	Value	Language
dc.contributor.author	HSU, LH	en_US
dc.contributor.author	WANG, PF	en_US
dc.contributor.author	WU, CT	en_US
dc.date.accessioned	2019-04-02T05:59:16Z	-
dc.date.available	2019-04-02T05:59:16Z	-
dc.date.issued	1992-01-01	en_US
dc.identifier.issn	0926-5473	en_US
dc.identifier.uri	http://hdl.handle.net/11536/149107	-
dc.description.abstract	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.	en_US
dc.language.iso	en_US	en_US
dc.subject	NONNUMERICAL ALGORITHMS AND PROBLEMS	en_US
dc.subject	GRAPH THEORY	en_US
dc.title	PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE	en_US
dc.type	Article	en_US
dc.identifier.journal	IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY	en_US
dc.citation.volume	12	en_US
dc.citation.spage	284	en_US
dc.citation.epage	290	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1992KV27500038	en_US
dc.citation.woscount	0	en_US
Appears in Collections:	Articles