The analysis of a nested dissection algorithm
- 1 July 1986
- journal article
- Published by Springer Nature in Numerische Mathematik
- Vol. 50 (4) , 377-404
- https://doi.org/10.1007/bf01396660
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Calculs de complexité relatifs à une méthode de dissection emboîtéeNumerische Mathematik, 1985
- A separator theorem for graphs of bounded genusJournal of Algorithms, 1984
- On the Problem of Partitioning Planar GraphsSIAM Journal on Algebraic Discrete Methods, 1982
- A layout strategy for VLSI which is provably good (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1982
- Computing the Minimum Fill-In is NP-CompleteSIAM Journal on Algebraic Discrete Methods, 1981
- Area-efficient graph layoutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONSPublished by Elsevier ,1972
- Decomposition of Finite Graphs Into ForestsJournal of the London Mathematical Society, 1964