Some nested dissection order is nearly optimal
- 25 January 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 26 (6), 325-328
- https://doi.org/10.1016/0020-0190(88)90191-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Computational models and task scheduling for parallel sparse Cholesky factorizationParallel Computing, 1986
- The analysis of a nested dissection algorithmNumerische Mathematik, 1986
- A separator theorem for graphs of bounded genusJournal of Algorithms, 1984
- A Separator Theorem for Chordal GraphsSIAM Journal on Algebraic Discrete Methods, 1984
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Generalized Nested DissectionSIAM Journal on Numerical Analysis, 1979
- An Automatic Nested Dissection Algorithm for Irregular Finite Element ProblemsSIAM Journal on Numerical Analysis, 1978
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- Sur les assemblages de lignes.Journal für die reine und angewandte Mathematik (Crelles Journal), 1869