Abstract:
We present an alternative linear time algorithm that computes an ordering that produces a fill-in that is minimal with respect to the subset relation. It is simpler than the algorithm in [6] and is easily parallelizable. The algorithm does not rely on the computation of a breadth-first search tree. 1
Citations
|
288
|
A separator theorem for planar graphs
– Lipton, Tarjan
- 1979
|
|
245
|
Algorithmic Aspects of Vertex Elimination on Graphs
– Rose, Tarjan, et al.
- 1976
|
|
131
|
Computing the minimum fill-in is NP-complete
– Yannakakis
- 1981
|
|
103
|
An O(log n) parallel connectivity algorithm
– Shiloach, Vishkin
- 1982
|
|
100
|
Triangulated graphs and the elimination process
– Rose
- 1970
|
|
89
|
The Intersection graphs of subtrees in trees are exactly the chordal graphs
– Gavril
- 1974
|
|
88
|
A simple parallel tree contraction algorithm
– Abrahamson, Dadoun, et al.
- 1989
|
|
49
|
Simple linear time algorithms to test chordiality of graphs, test acyclicity of graphs, and selectively reduce acyclic hypergraphs
– Tarjan, Yannakakis
|
|
30
|
Characterizations of strongly chordal graphs. Discrete Math
– Farber
- 1983
|
|
28
|
The analysis of a nested dissection algorithm
– Gilbert, Tarjan
- 1987
|
|
24
|
Minimal elimination ordering inside a given chordal graph
– Dahlhaus
- 1997
|
|
16
|
A linear-processor polylog-time algorithm for shortest-paths in planar graphs
– Klein, Subramanian
- 1993
|
|
12
|
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
– Dahlhaus, Karpinski
- 1989
|
|
8
|
A Characterization of Rigid Circuit Graphs, Discrete Mathematics 9
– Bunemann
- 1974
|
|
6
|
Cutting Down on Fill-in Using Nested Dissection, in Sparse Matrix Computations: Graph Theory Issues and Algorithms
– Agrawal, Klein, et al.
- 1993
|
|
6
|
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges, Algorithm Theory-SWAT '96
– Blair, Heggernes, et al.
- 1996
|
|
6
|
How to use minimal separators for its chordal triangulation
– Parra, Scheffler
- 1995
|
|
5
|
Finding Biconnected Components in Logarithmic Parallel
– Tarjan, Vishkin
- 1985
|
|
3
|
Minimal Elimination Ordering for Graphs of Bounded Degree, submitted
– Dahlhaus
- 2002
|
|
3
|
Finite Element Tutorial, TUBergakademie
– Eiermann, Ernst, et al.
|
|
3
|
Triangulating a Monotone Polygon
– Wagener
- 1988
|
|
2
|
Minimal Elimination of Planar Graphs, Algorithm Theory
– Dahlhaus
- 1998
|
|
