Improving the run time and quality of nested dissection ordering

SIAM Journal on Scientific Computing

Volumn 20, Issue 2, 1998, Pages 468-489

  Hendrickson, Bruce ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Graph algorithms; Graph partitioning; Minimum degree; Nested dissection; Sparse matrix ordering

Indexed keywords

DISSECTION ORDERING; GRAPH PARTITIONING; LIU MULTIPLE MINIMUM DEGREE; SPARSE MATRIX ORDERING;

GRAPH THEORY; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY;

ALGORITHMS;

EID: 0032228620     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827596300656     Document Type: Article

References (2)

1. R. AHUJA, T. MAGNANTI, AND J. ORLIN, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Edgewood Cliffs, NJ, 1993.
2. P. AMESTOY, T. DAVIS, AND I. DUFF, An Approximate Minimum Degree Ordering Algorithm, Tech. Rep. TR-94-039, University of Florida, Gainesville, FL, 1994.