The analysis of a nested dissection algorithm
Numerische Mathematik
On the performance of the minimum degree ordering for Gaussian elimination
SIAM Journal on Matrix Analysis and Applications
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Modification of the minimum-degree algorithm by multiple elimination
ACM Transactions on Mathematical Software (TOMS)
Minimizing elimination tree height can increase fill more than linearly
Information Processing Letters
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
An Approximate Minimum Degree Ordering Algorithm
SIAM Journal on Matrix Analysis and Applications
Node Selection Strategies for Bottom-Up Sparse Matrix Ordering
SIAM Journal on Matrix Analysis and Applications
Parallelizing Elimination Orders with Linear Fill
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |