An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph

Published:1994-11 Issue:2 Volume:134 Page:493-528
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Dahlhaus Elias,Karpinski Marek

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference39 articles.

1. A random NC algorithm for depth first search;Aggarwal;Proc. 19th ACM-STOC,1987

2. A characterization on rigid circuit graphs;Bunemann;Discrete Math.,1974

3. A complexity theory for unbounded fan-in parallelism;Chandra;Proc. 23th FOCS,1982

4. Parallel merge sort;Cole;Proc. 27th FOCS,1986

5. A taxonomy of problems with fast parallel algorithms;Cook;Inform. and Control,1985

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree;Theoretical Computer Science;2008-12

2. Minimal triangulations of graphs: A survey;Discrete Mathematics;2006-02

3. Approximating the Bandwidth for Asteroidal Triple-Free Graphs;Journal of Algorithms;1999-07

4. Minimal elimination of planar graphs;Algorithm Theory — SWAT'98;1998

5. Minimal elimination ordering inside a given chordal graph;Graph-Theoretic Concepts in Computer Science;1997

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP