Using domain decomposition to find graph bisectors
- 1 September 1997
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 37 (3) , 506-534
- https://doi.org/10.1007/bf02510238
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Compressed Graphs and the Minimum Degree AlgorithmSIAM Journal on Scientific Computing, 1995
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel ComputationsSIAM Journal on Scientific Computing, 1995
- Finding good approximate vertex and edge partitions is NP-hardInformation Processing Letters, 1992
- Computing the block triangular form of a sparse matrixACM Transactions on Mathematical Software, 1990
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- A graph partitioning algorithm by node separatorsACM Transactions on Mathematical Software, 1989
- The Evolution of the Minimum Degree Ordering AlgorithmSIAM Review, 1989
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970