National Tsing Hua University Institutional Repository:A linear-time algorithm for constructing an optimal node-search strategy of a tree
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54367/62174 (87%)
造访人次 : 14652951      在线人数 : 73
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 會議論文  >  A linear-time algorithm for constructing an optimal node-search strategy of a tree


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/66404


    题名: A linear-time algorithm for constructing an optimal node-search strategy of a tree
    作者: Sheng-Lung Peng;Chin-Wen Ho;Tsan-Sheng Hsu;Ming-Tat Ko;Chuan Yi Tang
    教師: 唐傳義
    日期: 1998
    出版者: Springer Verlag
    關聯: Computing and Combinatorics. 4th Annual International Conference COCOON'98. Proceedings,p 279-88,1998
    关键词: computational complexity
    tree searching
    trees
    linear-time algorithm
    optimal node-search
    摘要: 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
    显示于类别:[資訊工程學系] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML236检视/开启


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

    SFX Query

    與系統管理員聯絡

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