THE MOST VITAL EDGES OF MATCHING IN A BIPARTITE GRAPH

Full metadata record

DC Field	Value	Language
dc.contributor.author	HUNG, CN	en_US
dc.contributor.author	HSU, LH	en_US
dc.contributor.author	SUNG, TY	en_US
dc.date.accessioned	2014-12-08T15:04:28Z	-
dc.date.available	2014-12-08T15:04:28Z	-
dc.date.issued	1993-07-01	en_US
dc.identifier.issn	0028-3045	en_US
dc.identifier.uri	http://dx.doi.org/10.1002/net.3230230413	en_US
dc.identifier.uri	http://hdl.handle.net/11536/2966	-
dc.description.abstract	Let G = (VE) be an undirected graph having an edge weight w(e) greater-than-or-equal-to 0 for each e is-an-element-of E. An edge is called a most vital edge (with respect to weighted matching) if its removal from G results in the largest decrease in the total weight of the maximum weighted matching. In this paper, we study the most vital edges of matching in a weighted bipartite graph. We present an 0(n3) algorithm to obtain the most vital edges.	en_US
dc.language.iso	en_US	en_US
dc.title	THE MOST VITAL EDGES OF MATCHING IN A BIPARTITE GRAPH	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1002/net.3230230413	en_US
dc.identifier.journal	NETWORKS	en_US
dc.citation.volume	23	en_US
dc.citation.issue	4	en_US
dc.citation.spage	309	en_US
dc.citation.epage	313	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1993LH18300012	-
dc.citation.woscount	7	-
Appears in Collections:	Articles