National Tsing Hua University Institutional Repository:Balanced spanning trees in complete and incomplete star graphs
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14170648      Online Users : 58
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
    NTHUR > College of Electrical Engineering and Computer Science > Department of Computer Science > CS Journal / Magazine Articles >  Balanced spanning trees in complete and incomplete star graphs

    Please use this identifier to cite or link to this item:

    Title: Balanced spanning trees in complete and incomplete star graphs
    Authors: Chen,Tzung-Shi
    Date: 1996
    Publisher: Institute of Electrical and Electronics Engineers Inc
    Keywords: Parallel processing systems
    Interconnection networks
    Problem solving
    Data structures
    Computer architecture
    Pipeline processing systems
    Abstract: 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.
    Relation Link:
    Appears in Collections:[Department of Computer Science] CS Journal / Magazine Articles
    [Institute of Communications Engineering] COM Journal / Magazine Articles

    Files in This Item:

    File Description SizeFormat
    2030224010014.pdf751KbAdobe PDF906View/Open


    SFX Query


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