English  |  正體中文  |  简体中文  |  Items with full text/Total items : 60861/93527 (65%)
Visitors : 1495857      Online Users : 17
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/37564

    Title: Algorithms for finding the most complicated loop-free and loop-once paths
    Authors: 莊淇銘;Chung, Chi-ming;Yang, Ming-guey;Chou, Jung-huei
    Contributors: 淡江大學資訊工程學系
    Date: 1989-12
    Issue Date: 2010-01-11 13:43:18 (UTC+8)
    Relation: 中華民國七十八年全國計算機會議論文集 = Proceedings of National Computer Symposium, R.O.C., pp.522-530
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Proceeding

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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