Anne Berry, Pinar Heggernes, Genevieve Simonet  Home/Search
Context
Related
| isima.fr/~berry/MD.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: isima.fr/~berry/publis (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The Minimum Degree Algorithm, one of the classical algorithms of sparse matrix computations, is a heuristic for computing a minimum triangulation of a graph. It is widely used as a component in every sparse matrix package, and it is known to produce triangulations with few fill edges in practice, although no theoretical bound or guarantee has been shown concerning the amount of fill it introduces. An additional remarkable property of Minimum Degree observed in practice is that it often produces ... (Update)
Similar documents (at the sentence level):
7.6%: Weaving through a Crowd of Minimal Separators - Berry (2003) (Correct)
Active bibliography (related documents): More All
1.0: Maximum Cardinality Search for Computing - Minimal Triangulations Of (Correct)
0.8: A Wide-Range Algorithm for Minimal Triangulation.. - Berry, Bordat.. (2003) (Correct)
0.6: An on-Line Incremental Approach for Dynamically.. - Berry, Heggernes.. (2003) (Correct)
Similar documents based on text: More All
0.4: The Computational Complexity of the minimum degree.. - Heggernes, Eisenstat.. (2001) (Correct)
0.3: Finding Good Column Orderings for Sparse QR Factorization - Heggernes, Matstoms (1996) (Correct)
0.3: Performance Of Greedy Ordering Heuristics For Sparse Cholesky.. - Ng, Raghavan (1997) (Correct)
BibTeX entry: (Update)
@misc{ berry-minimum,
author = "Anne Berry and Pinar Heggernes and Genevieve Simonet",
title = "The Minimum Degree Heuristic and the Minimal",
url = "citeseer.ist.psu.edu/573590.html" }
Citations (may not include all citations):582 Local computations with probabilities on graphical structure.. (context) - Lauritzen, Spiegelhalter - 1988
488 Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
178 Algorithmic aspects of vertex elimination on graphs (context) - Rose, Tarjan et al. - 1976
119 Simple linear-time algorithms to test chordality of graphs (context) - Tarjan, Yannakakis - 1984
98 An approximate minimum degree ordering algorithm - Amestoy, Davis et al. - 1996
97 Incidence matrices and interval graphs (context) - Fulkerson, Gross - 1965
90 On rigid circuit graphs (context) - Dirac - 1961
80 The evolution of the minimum degree ordering algorithm (context) - George, Liu - 1989
57 A graph-theoretic study of the numerical solution of sparse .. (context) - Rose - 1972
54 The elimination form of the inverse and its application to l.. (context) - Markowitz - 1957
39 Direct solutions of sparse network equations by optimally or.. (context) - Tinney, Walker - 1967
21 How to use the minimal separators of a graph for its chordal.. - Parra, Sche - 1995
19 The use of linear graphs in Gauss elimination (context) - Parter - 1961
18 Minimal triangulation of a graph and optimal pivoting order .. (context) - Ohtsuki, Cheung et al. - 1976
16 Representation of a nite graph by a set of intervals on the .. (context) - Lekkerkerker, Ch - 1962
15 Computer Solution of Large Sparse Positive De nite Systems (context) - George, Liu - 1981
12 Computing the minimum ll-in is NP-complete (context) - Yannakakis - 1981
12 Equivalent sparse matrix reorderings by elimination tree rot.. (context) - Liu - 1988
11 Minimal elimination ordering inside a given chordal graph - Dahlhaus - 1997
11 Maximum Cardinality Search for Computing Minimal Triangulati.. (context) - Berry, Blair et al. - 2002
8 esarticulation d'un graphe (context) - Berry - 1998
8 Chordal completions of planar graphs (context) - Chung, Mumford - 1994
8 On treewidth and minimum ll-in of asteroidal triplefree grap.. (context) - Kloks, Kratsch et al. - 1997
7 A wide-range algorithm for minimal triangulation from an arb.. - Berry, Bordat et al. - 2003
4 A practical algorithm for making lled graphs minimal (context) - Blair, Heggernes et al. - 2001
4 Minimal orderings revisited (context) - Peyton - 2001
1 The computational complexity of the Minimum Degree algorithm - Heggernes, Eisenstat et al. - 2001
http://math.nist.gov/MatrixMarket/
Documents on the same site (http://www.isima.fr/~berry/publis.html): More
Triangulated and Weakly Triangulated Graphs: Simpliciality in.. - Berry, Bordat (2001) (Correct)
Local LexBFS Properties in an Arbitrary Graph - Berry, Bordat (2000) (Correct)
Asteroidal Triples of Moplexes - Berry, Bordat (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC