How Good is Recursive Bisection?
- 1 September 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 18 (5), 1436-1445
- https://doi.org/10.1137/s1064827593255135
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel ComputationsSIAM Journal on Scientific Computing, 1995
- Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problemsConcurrency: Practice and Experience, 1994
- Execution time support for adaptive scientific algorithms on distributed memory machinesConcurrency: Practice and Experience, 1991
- A Partitioning Strategy for Nonuniform Problems on MultiprocessorsIEEE Transactions on Computers, 1987
- Iterative Methods for the Solution of Elliptic Problems on Regions Partitioned into SubstructuresSIAM Journal on Numerical Analysis, 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 Planar GraphsSIAM Journal on Applied Mathematics, 1979
- On sparse graphs with dense long pathsComputers & Mathematics with Applications, 1975
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973