An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
9
TL;DR: The first efficient parallel algorithm for computing the minimal elimination ordering (MEO) of an arbitrary graph is designed and is optimal up to a polylogarithmic factor with respect to the best sequential algorithm of Rose, et al. (1976).
read more
About: This article is published in Theoretical Computer Science. The article was published on 21 Nov 1994. and is currently open access. The article focuses on the topics: Sequential algorithm & Parallel algorithm.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Minimal triangulations of graphs: A survey
TL;DR: This survey presents and ties together a variety of algorithms for computing minimal triangulations of both general and restricted graph classes in a unified modern notation, keeping an emphasis on the algorithms.
247
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
Ton Kloks,Dieter Kratsch,Haiko Müller +2 more
- 25 Sep 1995
TL;DR: It is shown that there is an O(n3) algorithm to approximate the bandwidth of an AT-free graph with worst case performance ratio 2 and that at the cost of the approximation factor, this algorithm can also be obtained within a factor 4.
78
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
TL;DR: It is shown that there is an O(nm) algorithm to approximate the bandwidth of an AT-free graph with worst case performance ratio 2 and that at the cost of the approximation factor, this algorithm can also be obtained within a factor 4.
76
Minimal elimination ordering inside a given chordal graph
Dias Dahlhaus,Dias Dahlhaus +1 more
- 18 Jun 1997
TL;DR: In this article, the authors considered the relative minimal elimination order problem on chordal graphs, and showed that it can be done in O(nm) time, which is the fastest known algorithm for chordal elimination order.
32
Parallel solution of sparse linear systems
Babak Nader
- 01 Jan 1987
TL;DR: This work investigates and develops a fast, scalable implementation of the Lanczos algorithm over GF (p) that can solve large, sparse linear systems in parallel using workstation clusters and dedicated Beowulf clusters.
16
References
•Book
Algorithmic graph theory and perfect graphs
Martin Charles Golumbic
- 01 Jan 1980
TL;DR: This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems and remains a stepping stone from which the reader may embark on one of many fascinating research trails.
4.3K
Algorithmic Aspects of Vertex Elimination on Graphs
TL;DR: A graph-theoretic elimination process which is related to performing Gaussian elimination on sparse symmetric positive definite systems of linear equations is considered, and it is conjecture that the problem of finding a minimum ordering is NP-complete.
1.4K
Parallel Prefix Computation
TL;DR: A recurstve construction is used to obtain a product circuit for solving the prefix problem and a Boolean clrcmt which has depth 2[Iog2n] + 2 and size bounded by 14n is obtained for n-bit binary addmon.