University of Taipei:Item 987654321/16008
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 1935/17148 (11%)
造访人次 : 849353      在线人数 : 426
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version
    University of Taipei > 理學院 > 資訊科學系 > 會議論文 >  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:[資訊科學系] 會議論文

    Files in This Item:

    There are no files associated with this item.



    All items in uTaipei are protected by copyright, with all rights reserved.

    如有問題歡迎與系統管理員聯繫
    02-23113040轉2132
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback