Minimal Elimination Ordering for Graphs of Bounded (1999)
Download:
|
|
by Elias Dahlhaus
ftp://ftp.zpr.uni-koeln.de/pub/paper/zpr99-354.ps.gz
Add To MetaCart
Abstract:
We show that for graphs of bounded degree, a subset minimal elimination ordering can be determined in almost linear time. 1
Citations
| 245 | Algorithmic Aspects of Vertex Elimination on Graphs – Rose, Tarjan, et al. - 1976 |
| 131 | Computing the minimum fill-in is NP-complete – Yannakakis - 1981 |
| 100 | Triangulated graphs and the elimination process – Rose - 1970 |
| 89 | The Intersection graphs of subtrees in trees are exactly the chordal graphs – Gavril - 1974 |
| 30 | Characterizations of strongly chordal graphs. Discrete Math – Farber - 1983 |
| 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 | How to use minimal separators for its chordal triangulation – Parra, Scheffler - 1995 |
| 2 | Minimal Elimination of Planar Graphs – Dahlhaus - 1998 |
| 2 | Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representation – Dahlhaus - 1994 |
| 2 | The analysis of a nested dissection algorithm. Numerische Mathematik – Gilbert, Tarjan - 1987 |
