English  |  正體中文  |  简体中文  |  Items with full text/Total items : 89914/105178 (85%)
Visitors : 4594466      Online Users : 642
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
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/4667


    Title: Maximizing the number of spanning trees of networks based on cycle basis representation
    Authors: S. S. Tseng;L. R. Wang
    Contributors: Department of Information Science and Applications
    Date: 1989
    Issue Date: 2009-11-30 16:03:01 (UTC+8)
    Publisher: Asia University
    Relation: International journal of computer mathematics 29(2-4):65-74
    Appears in Collections:[行動商務與多媒體應用學系] 期刊論文

    Files in This Item:

    There are no files associated with this item.



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


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