English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 76645/76646 (100%)
造訪人次 : 39753957      線上人數 : 956
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29165


    題名: An efficient parallel strategy for computing K-terminal reliability and finding most vital edges in 2-trees and partial 2-trees
    作者: Ho,CW;Hsieh,SY;Chen,GH
    貢獻者: 資訊工程研究所
    關鍵詞: STEINER TREES;NETWORKS;GRAPHS;COMPLEXITY;ALGORITHMS;COMPUTATIONS;PLANAR
    日期: 1998
    上傳時間: 2010-06-29 20:15:17 (UTC+8)
    出版者: 中央大學
    摘要: In this paper, we first develop a parallel algorithm for computing K-terminal reliability, denoted by R(G(K)), in 2-trees. Based on this result, we can also compute R(G(K)) in partial 2-trees using a method that transforms, in parallel, a given partial 2-tree into a 2-tree. Finally, we solve the problem of finding most vital edges with respect to K-terminal reliability in partial 2-trees. Our algorithms take O(log n) time with C(m, n) processors on a CRCW PRAM, where C(m, n) is the number of processors required to find the connected components of a graph with m edges and n vertices in logarithmic lime. (C) 1998 Academic Press.
    關聯: JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
    顯示於類別:[資訊工程研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML419檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明