THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES IN 2-TERMINAL SERIES-PARALLEL GRAPHS

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	JAN, RH	en_US
dc.contributor.author	HSU, LH	en_US
dc.contributor.author	LEE, YY	en_US
dc.date.accessioned	2014-12-08T15:05:03Z	-
dc.date.available	2014-12-08T15:05:03Z	-
dc.date.issued	1992	en_US
dc.identifier.issn	0006-3835	en_US
dc.identifier.uri	http://hdl.handle.net/11536/3587	-
dc.identifier.uri	http://dx.doi.org/10.1007/BF02074877	en_US
dc.description.abstract	A set E' of k edges in a multigraph G = (V, E) is said to be a k most vital edge set (k-MVE set) if these edges being removed from G, the resultant graph G' = (V,E - E') has minimum number of spanning trees. The problem of finding a k-MVE set for two-terminal series-parallel graphs is considered in this paper. We present an O(Absolute value of E) time algorithm for the case k = 1, and an O(Absolute value of V(k) + Absolute value of E) time algorithm for arbitrary k.	en_US
dc.language.iso	en_US	en_US
dc.subject	MOST VITAL EDGES	en_US
dc.subject	SPANNING TREES	en_US
dc.subject	2-TERMINAL SERIES-PARALLEL GRAPHS	en_US
dc.title	THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES IN 2-TERMINAL SERIES-PARALLEL GRAPHS	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1007/BF02074877	en_US
dc.identifier.journal	BIT	en_US
dc.citation.volume	32	en_US
dc.citation.issue	3	en_US
dc.citation.spage	403	en_US
dc.citation.epage	412	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1992JR59200003	-
dc.citation.woscount	4	-
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。