English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 49521/84657 (58%)
造訪人次 : 7600710      線上人數 : 86
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/96127

    題名: Smallest Bipartite Bridge-connectivity Augmentation
    作者: Huang, Pei-Chi;Wei, Hsin-Wen;Lu, Wan-Chen;Shih, Wei-Kuan;Hsu, Tsan-sheng
    貢獻者: 淡江大學電機工程學系
    關鍵詞: 2-edge-connectivity;Bridge-connectivity;Data security;Bipartite graph augmentation
    日期: 2009-07
    上傳時間: 2014-03-03 16:27:08 (UTC+8)
    出版者: New York: Springer New York LLC
    摘要: This paper addresses two augmentation problems related to bipartite graphs. The first, a fundamental graph-theoretical problem, 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, and still bipartite. The second problem, which arises naturally from research on the security of statistical data, is how to add edges so that the resulting graph is simple and does not contain any bridges. In both cases, after adding edges, the graph can be either a simple graph or, if necessary, a multi-graph. Our approach then determines whether or not such an augmentation is possible.
    We propose a number of simple linear-time algorithms to solve both problems. Given the well-known bridge-block data structure for an input graph, the algorithms run in O(log n) parallel time on an EREW PRAM using a linear number of processors, where n is the number of vertices in the input graph. We note that there is already a polynomial time algorithm that solves the first augmentation problem related to graphs with a given general partition constraint in O(n(m+nlog n)log n) time, where m is the number of distinct edges in the input graph. We are unaware of any results for the second problem.
    關聯: Algorithmica 54(3), pp.353-378
    DOI: 10.1007/s00453-007-9127-1
    顯示於類別:[電機工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數



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