An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- 1 March 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 16 (2), 452-469
- https://doi.org/10.1137/0916028
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A unified geometric approach to graph separatorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A genetic approach for network partitioningInternational Journal of Computer Mathematics, 1992
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- Graph partitioning by EigenvectorsLinear Algebra and its Applications, 1988
- An algorithm for quadrisection and its application to standard cell placementIEEE Transactions on Circuits and Systems, 1988
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- On the determination of χl,η+−0 AND η000 from bubble chamber measurementsCzechoslovak Journal of Physics, 1975
- Lower Bounds for the Partitioning of GraphsIBM Journal of Research and Development, 1973
- Algebraic connectivity of graphsCzechoslovak Mathematical Journal, 1973
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970