DeepAI AI Chat
Log In Sign Up

A Fast Minimum Degree Algorithm and Matching Lower Bound

by   Robert Cummings, et al.
University of Waterloo
Georgia Institute of Technology

The minimum degree algorithm is one of the most widely-used heuristics for reducing the cost of solving large sparse systems of linear equations. It has been studied for nearly half a century and has rich history of bridging techniques from data structures, graph algorithms, and direct methods in scientific computing. We present a simple but novel combinatorial algorithm for computing minimum degree elimination orderings in O(nm) time that relies on a careful amortized analysis. Furthermore, we show that there cannot exist an algorithm for this problem that runs in O(nm^1-ε) time, for any ε > 0, assuming the strong exponential time hypothesis.


page 1

page 2

page 3

page 4


On Computing Min-Degree Elimination Orderings

We study faster algorithms for producing the minimum degree ordering use...

Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm

Motivated by the study of matrix elimination orderings in combinatorial ...

Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee's Measure Problem

We present a (combinatorial) algorithm with running time close to O(n^d)...

L is unequal NL under the Strong Exponential Time Hypothesis

Due to Savitch's theorem we know NL⊆ DSPACE(log^2(n)). To show this uppe...

Fast Neighborhood Rendezvous

In the rendezvous problem, two computing entities (called agents) locate...

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality

Seminal results establish that the coverability problem for Vector Addit...