Chung-Hua University Repository:Item 987654321/31983
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 8557/14866 (58%)
Visitors : 1990816      Online Users : 1151
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope 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


    Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/31983


    Title: Two-Sided Single-Detour Untangling for Bus Routing
    Authors: 顏金泰
    YAN, JIN-TAI
    Contributors: 資訊工程學系
    Computer Science & Information Engineering
    Keywords: PCB Design;Bus Routing;Single-Detour Untangling
    Date: 2010
    Issue Date: 2014-06-27 01:40:56 (UTC+8)
    Abstract: In this paper, a two-sided single-detour untangling problem with capacity constraints can be firstly formulated. Furthermore, based on the optimality of hierarchical bubble sorting, an O(n2) algorithm is proposed to solve the two-sided untangling problem
    Appears in Collections:[Department of Computer Science and Information Engineering] Seminar Papers

    Files in This Item:

    File Description SizeFormat
    s_e331_0384.pdf26KbAdobe PDF55View/Open


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

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback