National Tsing Hua University Institutional Repository:Balanced spanning trees in complete and incomplete star graphs
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54367/62174 (87%)
造访人次 : 14170674      在线人数 : 58
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 期刊論文 >  Balanced spanning trees in complete and incomplete star graphs


    题名: Balanced spanning trees in complete and incomplete star graphs
    作者: Chen,Tzung-Shi
    日期: 1996
    出版者: Institute of Electrical and Electronics Engineers Inc
    关键词: Parallel processing systems
    Interconnection networks
    Problem solving
    Data structures
    Computer architecture
    Pipeline processing systems
    摘要: Efficiently solving the personalized broadcast problem in an interconnection network typically relies on finding an appropriate spanning tree in the network. In this paper, we show how to construct in a complete star graph an asymptotically balanced spanning tree, and in an incomplete star graph a near-balanced spanning tree. In both cases, the tree is shown to have the minimum height. In the literature, this problem has only been considered for the complete star graph, and the constructed tree is about 4/3 times taller than the one proposed in this paper.
    显示于类别:[資訊工程學系] 期刊論文
    [通訊工程研究所] 期刊論文


    档案 描述 大小格式浏览次数
    2030224010014.pdf751KbAdobe PDF906检视/开启


    SFX Query


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