English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14639692      Online Users : 56
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 new distributed algorithm for the biconnectivity problem

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

    Title: A new distributed algorithm for the biconnectivity problem
    Authors: Shing-Tsaan Huang
    教師: 黃興燦
    Date: 1989
    Publisher: Pennsylvania State Univ. Press
    Relation: Proceedings of the 1989 International Conference on Parallel Processing,1989,Pages106-13, vol.3
    Keywords: distributed algorithm
    Abstract: A distributed algorithm for finding biconnected components on asynchronous communication networks is presented. A novel approach is used in the algorithm: instead of building auxiliary graphs as in most parallel algorithms, the author developed two cutting rules to selectively put cuts on edges such that edges in the resulting graph are connected if they are in the same biconnected component in the original graph. Let n be the number of processor nodes and k be the maximum node degree of the graph modeling the network. The proposed algorithm therefore uses messages with length of O(logn) bits and has each processor node equipped with storage space of O(klogn) bits only. The worst case computational time on each node is O(nk)
    URI: http://www.psupress.org/
    Appears in Collections:[資訊工程學系] 會議論文

    Files in This Item:

    File Description SizeFormat


    SFX Query


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