A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering
- 1 January 1998
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 48 (1) , 71-95
- https://doi.org/10.1006/jpdc.1997.1403
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Multilevelk-way Partitioning Scheme for Irregular GraphsJournal of Parallel and Distributed Computing, 1998
- Highly scalable parallel algorithms for sparse matrix factorizationIEEE Transactions on Parallel and Distributed Systems, 1997
- PMRSBPublished by Association for Computing Machinery (ACM) ,1995
- Parallelism in graph-partitioningJournal of Parallel and Distributed Computing, 1991
- Parallel Algorithms for Sparse Linear SystemsSIAM Review, 1991
- Computing the block triangular form of a sparse matrixACM Transactions on Mathematical Software, 1990
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Modification of the minimum-degree algorithm by multiple eliminationACM Transactions on Mathematical Software, 1985
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970