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


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


    题名: EFFICIENT PARALLEL ALGORITHMS FOR FINDING MAXIMAL CLIQUES, CLIQUE TREES, AND MINIMUM COLORING ON CHORDAL GRAPHS
    作者: Ho, C. W.;Lee, R. C. T.
    教師: 李家同
    日期: 1988
    出版者: Elsevier
    關聯: INFORMATION PROCESSING LETTERS, Elsevier, Volume 28, Issue 6, AUG 29 1988, Pages 301-309
    关键词: Chordal graph
    parallel processing
    graph separator
    analysis of algorithms
    computational complexity
    摘要: Naor et al. (1987) proposed parallel algorithms for several problems on chordal graphs such as computing maximal cliques, a minimum coloring, a perfect elimination scheme and so on. They first solved the problem of computing maximal cliques in O(log2n) time with O(n5+ϵ) processors and, using this result, they solved all the other problems. In this paper we propose another parallel algorithm for maximal cliques which can be executed in O(log2n) time by using only O(n3) processors. This results reduces the processor bound from O(n5+ϵ) to O(n3) for all the problems solved by Naor et al. Based upon this result we propose another two algorithms for computing a clique tree and minimum coloring which are more efficient than those proposed by Naor et al.
    相関连結: http://www.elsevier.com/wps/find/homepage.cws_home
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80821
    显示于类别:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    文件中的档案:

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


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

    SFX Query

    與系統管理員聯絡

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