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

完整後設資料紀錄

DC 欄位	值	語言
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-02T06:04:40Z	-
dc.date.available	2019-04-02T06:04:40Z	-
dc.date.issued	1992-01-01	en_US
dc.identifier.issn	0926-5473	en_US
dc.identifier.uri	http://hdl.handle.net/11536/151129	-
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	Proceedings Paper	en_US
dc.identifier.journal	ALGORITHMS, SOFTWARE, ARCHITECTURE : INFORMATION PROCESSING 92, VOL 1	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:A1992BX74K00038	en_US
dc.citation.woscount	0	en_US
顯示於類別：	會議論文