The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Parallel multilevel k-way partitioning scheme for irregular graphs
Abstract
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. The multilevel k-way partitioning algorithm reduces the size of the graph by collapsing vertices and edges (coarsening phase), finds a k-way partition of the smaller graph, and then it constructs a k-way partition for the original graph by projecting and refining the partition to successively finer graphs (uncoarsening phase). A key innovative feature of our parallel formulation is that it utilizes graph coloring to effectively parallelize both the coarsening and the refinement during the uncoarsening phase. Our algorithm is able to achieve a high degree of concurrency, while maintaining the high quality partitions produced by the serial algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
Partitioning Sparse Matrices with Eigenvectors of Graphs
Pothen, A., Simon, H. D., & Liou, K.-P. (1990) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0611030 · Cited by 1,684
New spectral methods for ratio cut partitioning and clustering
Hagen, L., & Kahng, A. B. (1992) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.159993 · Cited by 1,288
Introduction to parallel computing: design and analysis of algorithms
Kumar, V., Grama, A. Y., Gupta, A., & Karypis, G. (1994) · Benjamin-Cummings Publishing Co., Inc. eBooks · Cited by 1,210
Self-citationDepartment of Computer Science
(1993) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(93)90083-n · Cited by 1,210
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Luby, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215074 · Cited by 1,147
A multilevel algorithm for partitioning graphs
Hendrickson, B., & Leland, R. (1995) · Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '95 · doi:10.1145/224170.224228 · Cited by 1,069
Nested Dissection of a Regular Finite Element Mesh
George, A. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710032 · Cited by 1,064
The Chaco user`s guide. Version 1.0
Hendrickson, B., & Leland, R. (1993) · doi:10.2172/10106339 · Cited by 655
Barnard, S. T., & Simon, H. D. (1994) · Concurrency: Practice and Experience · doi:10.1002/cpe.4330060203 · Cited by 488
Highly scalable parallel algorithms for sparse matrix factorization
Gupta, A., Karypis, G., & Kumar, V. (1997) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.598277 · Cited by 229
Self-citationA Parallel Graph Coloring Heuristic
Jones, M. T., & Plassmann, P. E. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914041 · Cited by 227
An improved two-way partitioning algorithm with stable performance (VLSI)
Cheng, C., & Wei, Y.-C. (1991) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.103500 · Cited by 149
Miller, G. L., Teng, S., Thurston, W. P. H., & Vavasis, S. A. (1993) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4613-8369-7_3 · Cited by 138
Johan, Z., Mathur, K. K., Johnsson, S. L., & Hughes, T. J. R. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57981-8_124 · Cited by 8
Cited by
Multilevelk-way Partitioning Scheme for Irregular Graphs
Karypis, G., & Kumar, V. (1998) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1997.1404 · Cited by 1,675
Self-citationGraph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
Scalable Molecular Dynamics with NAMD
(2016) · Parallel Science and Engineering Applications · doi:10.1201/b16251-15 · Cited by 639
A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering
Karypis, G., & Kumar, V. (1998) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1997.1403 · Cited by 500
Self-citationRecent Advances in Graph Partitioning
Buluç, A., Meyerhenke, H., Safro, I., Sanders, P., & Schulz, C. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_4 · Cited by 482
Metadata
- Authors
- Karypis, G., & Kumar, V.
- Venue
- Proceedings of the 1996 ACM/IEEE conference on Supercomputing
- Publisher
- IEEE Computer Society
- Published
- 1996-11-17
- Pages
- 35
- ISSN
- 1063-9535 (ISSN-L)
- OpenAlex
- W2124200646
- Cited by
- 310
- References
- 16
- FWCI
- 52.81
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.