English  |  正體中文  |  简体中文  |  Items with full text/Total items : 17744/20032 (89%)
Visitors : 7274206      Online Users : 317
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.cnu.edu.tw/handle/310902800/23174


    標題: 關於重覆邊數最少的網路問題
    Postman Problem and It's Extended Questioos On Some Graphs
    作者: 彭傳麗
    謝碧雪
    陶舜華
    貢獻者: 電腦中心
    關鍵字: 郵差
    尤拉圖形
    配對集
    Postman
    Eulerian
    Matching
    日期: 1994
    上傳時間: 2010-11-10 18:22:12 (UTC+8)
    摘要: 本篇論文主要在一些特殊的連通圖形中,討論把全部的邊都走過而使邊重覆最少的方法,主要結果如下:1.在連通網路中求封閉(開放)的全路徑之長度的最小上界。2.對於一些特殊連通圖形,找一個走過所有的邊,且邊的重覆次數最少的方法。
    This paper studies the postman problem and its extended questions. Some results are obtained as indicated in following. 1. We derive the least upper bound of the length of any closed (open) whole walk.2. We will present the number of “edge repetitions” of a shortest closed (open) whole walk about some kinds of graphs.
    關聯: 嘉南學報 20期:p.148-155
    Appears in Collections:[嘉南學報] 20期 (1994)

    Files in This Item:

    There are no files associated with this item.



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


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