References
- BergerMBokhariSPartitioning strategy for non uniform problems on multiprocessorsIEEE T Comput1987C-3657058010.1109/TC.1987.1676942
- Feder T, Hell P, Klein S and Motwani R ( 1999 ). Complexity of graph partition problems . Symposium on the Theory of Computing, STOC 1999, pp 464–472. Available at : www.cs.sfu.ca/~pavol/stoc.ps .
- Fiduccia C and Mattheyses R ( 1982 ). A linear time heuristic for improving network partitions . In : Proceedings of the Nineteenth IEEE Design Automation Conference . IEEE Press; Piscataway, NJ, pp 175–181. Available at : http://www.eecs.umich.edu/~mazum/fmcut1.pdf .
- HagerWKrylyukYGraph partitioning and continuous quadratic programmingSIAM J Discrete Math19991250052310.1137/S0895480199335829
- HeathMRaghavanPA cartesian parallel nested dissection algorithmSIAM J Matrix Anal Appl19951623525310.1137/S0895479892238270
- Hendrickson B and Leland R ( 1994 ). The Chaco User's Guide, Version 2.0 . Technical Report SAND94-2692, Sandia National Laboratories .
- KarypisGKumarVMultilevel k-way partitioning scheme for irregular graphsJ Parallel Distr Com1998489612910.1006/jpdc.1997.1404
- Karypis G and Kumar V ( 1998b ). MeTiS 4.0: Unstructured graph partitioning and sparse matrix ordering system . Technical Report. Dept. of Computer Science and Engineering, University of Minnesota .
- KernighanBLinSAn efficient heuristic procedure for partitioning graphsAT&T Tech197049291307
- k-metis and p-metis software ( 1998 ). Available at : http://glaros.dtc.umn.edu/gkhome/views/metis .
- KüçükpetekSPolatFOğztüzünHMultilevel graph partitioning: An evolutionary approachJ Opl Res Soc20055654956210.1057/palgrave.jors.2601837
- ÖncanTKabadiSNNairKPKPunnenAPVLSN search algorithms for partitioning problems using matching neighbourhoodsJ Opl Res Soc20085938839810.1057/palgrave.jors.2602356
- Pellegrini F and Roman J ( 1996 ). SCOTCH: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs, HPCN-Europe . In : Proceedings of High Performance Computing Networks '96, LNCS 1067 . Springer-Verlag: London, pp 493–498 .
- Pothen A, Simon HD, Wang L and Barnard ST ( 1992 ). Towards a fast implementation of spectral nested dissection . In : Werner R ( ed ). Conference Proceedings Supercomputing '92, Minneapolis. IEEE Comp. Soc. Press: Minneapolis, MN, pp 42–51 .
- PreisRDiekmannRPARTY, a software library for graph partitioningAdvances in Computational Mechanics with Parallel and Distributed Processing19976371
- Schloegel K, Karypis G and Kumar V ( 2000 ). Graph Partitioning for High Performance Scientific Simulations, Department of Computer Science & Engineering, University of Minnesota. Available at : http://www-users.cs.umn.edu/~karypis/publications/partitioning.html .
- SimonHSohnABiswasRHARP: A fast spectral partitionerIn: Proceedings of Ninth ACM Symposium on Parallel Algorithms and Architectures19974352
- Walshaw C ( 1998 ). Parallel JOSTLE user guide . Technical report user guide version 1.2.9, University of Greenwich, London, UK .