National Tsing Hua University Institutional Repository:COUNTING CLIQUE TREES AND COMPUTING PERFECT ELIMINATION SCHEMES IN PARALLEL
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54367/62174 (87%)
造访人次 : 13700225      在线人数 : 50
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 期刊論文  >  COUNTING CLIQUE TREES AND COMPUTING PERFECT ELIMINATION SCHEMES IN PARALLEL


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80822


    题名: COUNTING CLIQUE TREES AND COMPUTING PERFECT ELIMINATION SCHEMES IN PARALLEL
    作者: Ho, C. W.;Lee, R. C. T.
    教師: 李家同
    日期: 1989
    出版者: Elsevier
    關聯: INFORMATION PROCESSING LETTERS, Elsevier, Volume 31, Issue 2, APR 26 1989, Pages 61-68
    关键词: chordal graphs
    Parallel processing
    cliquetrees
    CREW PRAM
    CRCW PRAM
    摘要: In a previous result, the authors showed that a clique tree of a chordal graph can be constructed in O(log n) parallel computing time with O(n3) processors on CRCW PRAM, where n is the number of nodes of the graph. In this paper, it will be shown that this result can be extended in two ways. First, we show that from the parallelcliquetree constructing algorithm, we can derive an exact formula of countingcliquetrees of a labeled connected chordal graph. Next, we show that a perfecteliminationscheme of a chordal graph can be computed in O(log n) time with O(n2) processors on CREW PRAM once a cliquetree of the graph is given. This implies that a perfecteliminationscheme of a chordal graph can be computed in O(log n) time with O(n3) processors on CRCW PRAM.
    相関连結: http://www.elsevier.com/wps/find/homepage.cws_home
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80822
    显示于类别:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    文件中的档案:

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


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

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