English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 13860390      Online Users : 38
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU 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
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 會議論文  >  A linear-time algorithm for constructing an optimal node-search strategy of a tree


    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/66404


    Title: A linear-time algorithm for constructing an optimal node-search strategy of a tree
    Authors: Sheng-Lung Peng;Chin-Wen Ho;Tsan-Sheng Hsu;Ming-Tat Ko;Chuan Yi Tang
    教師: 唐傳義
    Date: 1998
    Publisher: Springer Verlag
    Relation: Computing and Combinatorics. 4th Annual International Conference COCOON'98. Proceedings,p 279-88,1998
    Keywords: computational complexity
    tree searching
    trees
    linear-time algorithm
    optimal node-search
    Abstract: Ellis et al. (1994) proposed algorithms (in terms of vertex separation) to compute the node-search number of an n-vertex tree T in O(n) time and to construct an optimal node-search strategy of T in O(n log n) time. An open problem is whether the latter can also be done in linear time. In this paper, we solve this open problem by exploring fundamental graph theoretical properties
    URI: http://www.springerlink.com/
    http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/66404
    Appears in Collections:[資訊工程學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML192View/Open


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

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