FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	HSU, LH	en_US
dc.contributor.author	JAN, RH	en_US
dc.contributor.author	LEE, YC	en_US
dc.contributor.author	HUNG, CN	en_US
dc.contributor.author	CHERN, MS	en_US
dc.date.accessioned	2014-12-08T15:05:09Z	-
dc.date.available	2014-12-08T15:05:09Z	-
dc.date.issued	1991-09-13	en_US
dc.identifier.issn	0020-0190	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/0020-0190(91)90028-G	en_US
dc.identifier.uri	http://hdl.handle.net/11536/3684	-
dc.language.iso	en_US	en_US
dc.subject	DATA STRUCTURES	en_US
dc.subject	DESIGN OF ALGORITHMS	en_US
dc.subject	MINIMUM SPANNING TREES	en_US
dc.title	FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/0020-0190(91)90028-G	en_US
dc.identifier.journal	INFORMATION PROCESSING LETTERS	en_US
dc.citation.volume	39	en_US
dc.citation.issue	5	en_US
dc.citation.spage	277	en_US
dc.citation.epage	281	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1991GM52700009	-
dc.citation.woscount	30	-
顯示於類別：	期刊論文

文件中的檔案：

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