English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51931/87076 (60%)
Visitors : 8480444      Online Users : 397
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/96126

    Title: The Bridge-connectivity Augmentation Problem with a partition Constraint
    Authors: Chen, Yen-Chiu;Wei, Hsin-Wen;Huang, Pei-Chi;Shih, Wei-Kuan;Hsu, Tsan-sheng
    Contributors: 淡江大學電機工程學系
    Keywords: 2-edge-connectivity;Bridge-connectivity;Augmentation;Partition constraint
    Date: 2010-06
    Issue Date: 2014-03-03 16:19:35 (UTC+8)
    Publisher: Amsterdam: Elsevier BV
    Abstract: In this paper, we consider the augmentation problem of an undirected graph with k partitions of its vertices. The main issue is how to add a set of edges with the smallest possible cardinality so that the resulting graph is 2-edge-connected, i.e., bridge-connected, while maintaining the original partition constraint. To solve the problem, we propose a simple linear-time algorithm. To the best of our knowledge, the most efficient sequential algorithm runs in O(n(m+nlogn)logn) time. However, we show that it can also run in O(logn) parallel time on an EREW PRAM using a linear number of processors, where n is the number of vertices in the input graph. If a simple graph exists, our main algorithm ensures that it is as simple as possible.
    Relation: Theoretical Computer Science 411(31–33), pp.2878–2889
    DOI: 10.1016/j.tcs.2010.04.019
    Appears in Collections:[電機工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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