Parallel static and dynamic multi‐constraint graph partitioning
- 1 March 2002
- journal article
- research article
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 14 (3) , 219-240
- https://doi.org/10.1002/cpe.605
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Parallel optimisation algorithms for multilevel mesh partitioningParallel Computing, 2000
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular GraphsSIAM Review, 1999
- PLUM : Parallel Load Balancing for Adaptive Unstructured MeshesJournal of Parallel and Distributed Computing, 1998
- Multilevel Algorithms for Multi-Constraint Graph PartitioningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1998
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- Multilevelk-way Partitioning Scheme for Irregular GraphsJournal of Parallel and Distributed Computing, 1998
- Multilevel circuit partitioningPublished by Association for Computing Machinery (ACM) ,1997
- A multilevel algorithm for partitioning graphsPublished by Association for Computing Machinery (ACM) ,1995
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970