政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75914
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 113869/144892 (79%)
造访人次 : 51888119      在线人数 : 353
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 >  Item 140.119/75914


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/75914


    题名: A New Node-Join-Tree Distributed Algorithm for Minimum Weight Spanning Trees
    作者: Lien, Yao-nan
    連耀南
    贡献者: 資科系
    日期: 1988
    上传时间: 2015-06-17 16:42:18 (UTC+8)
    摘要: A distributed algorithm that uses a node-join-tree approach for the minimum-spanning-tree problem in a communication network is developed. The algorithm needs at most (2e+n(n-1)/4) messages in O(n2 ) time on a general random graph. In the best case, it needs only 2e messages in O(log n) time. The parameters e and n are the number of edges and nodes, respectively. Although the worst-case performance is not better than that of tree-join-tree algorithms under some extreme cases, simulation results show that it provides better performance in most cases. The algorithm is initialized from a single node, so that there is no need to wake up all nodes at the beginning. It is less complicated than other algorithms, so that a reliable implementation is easier to achieve. The results can be used to improve the algorithms for many other problems in distributed computing, such as leader-election, node-counting, deadlock-resolution, and message-broadcasting
    關聯: International Conference on Distributed Computing Systems - ICDCS , pp. 334-340
    数据类型: conference
    DOI 連結: http://dx.doi.org/10.1109/DCS.1988.12534
    DOI: 10.1109/DCS.1988.12534
    显示于类别:[資訊科學系] 會議論文

    文件中的档案:

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


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈