English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67621/67621 (100%)
Visitors : 23039487      Online Users : 248
RC Version 7.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
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29698


    Title: AN ALGORITHM FOR FINDING THE K-QUICKEST PATHS IN A NETWORK
    Authors: CHEN,YL
    Contributors: 資訊管理研究所
    Keywords: SHORTEST
    Date: 1993
    Issue Date: 2010-06-29 20:38:31 (UTC+8)
    Publisher: 中央大學
    Abstract: Let N be a network with n nodes and m arcs, and let sigma be the amount of data to be transmitted. The quickest path problem is to find a routing path in N such that the time required to ship sigma units of data from the source to the sink is minimum. The problem considered in this paper is to find the first k quickest looping paths from the source to the sink, and an algorithm with time complexity of O(m2 + (m + k)n log n + k3/2 log k) is developed.
    Relation: COMPUTERS & OPERATIONS RESEARCH
    Appears in Collections:[資訊管理研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML458View/Open


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

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明