A heuristic algorithm for the bottleneck selected-internal minimum spanning tree problem

uTaipei > College of Science > Department of Computer Science > Proceedings > Item 987654321/16008

Please use this identifier to cite or link to this item: http://utaipeir.lib.utaipei.edu.tw/dspace/handle/987654321/16008

Title:	A heuristic algorithm for the bottleneck selected-internal minimum spanning tree problem
Authors:	陳彥宏
Contributors:	臺北市立教育大學資訊科學系
Date:	2013-04
Issue Date:	2017-07-31 13:50:56 (UTC+8)
Relation:	第30屆組合數學與計算理論研討會 (The 30th Workshop on Combinatorial Mathematics and Computational Theory)，國立東華大學，2013/04
Appears in Collections:	[Department of Computer Science] Proceedings

Files in This Item:

There are no files associated with this item.