The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Graph partitioning models for parallel computing
Open accessOverview
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
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
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
Some simplified NP-complete graph problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90059-1 · Cited by 2,059
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
Self-citationThe Chaco user`s guide. Version 1.0
Hendrickson, B., & Leland, R. (1993) · doi:10.2172/10106339 · Cited by 655
Self-citationHypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication
Çatalyürek, Ü. V., & Aykanat, C. (1999) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.780863 · Cited by 573
A Procedure for Placement of Standard-Cell VLSI Circuits
Dunlop, A. E., & Kernighan, B. W. (1985) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.1985.1270101 · Cited by 505
Multilevel Algorithms for Multi-Constraint Graph Partitioning
Karypis, G., & Kumar, V. (1998) · doi:10.5555/509058.509086 · Cited by 342
Improving the Run Time and Quality of Nested Dissection Ordering
Hendrickson, B., & Rothberg, E. E. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596300656 · Cited by 140
Self-citation
Cited by
Direct Methods for Sparse Matrices
Duff, I. S., Erisman, A. M., & Reid, J. K. (2017) · doi:10.1093/acprof:oso/9780198508380.001.0001 · Cited by 1,604
An Efficient Application Partitioning Algorithm in Mobile Environments
Wu, H., Knottenbelt, W. J., & Wolter, K. (2019) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2019.2891695 · Cited by 125
Metadata
- Authors
- Hendrickson, B., & Kolda, T. G.
- Venue
- Parallel Computing
- Publisher
- Elsevier BV
- Published
- 2000-11
- Volume
- 26
- Issue
- 12
- Pages
- 1519-1534
- ISSN
- 0167-8191 (ISSN-L)
- OpenAlex
- W2065309575
- Cited by
- 461
- References
- 9
- FWCI
- 10.81
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Graph partitioning models for parallel computing. https://app.cochat.ai/papers/10.1016/s0167-8191(00)00048-x
- The paper
- Hendrickson, B., & Kolda, T. G. (2000). Graph partitioning models for parallel computing. Parallel Computing. https://doi.org/10.1016/s0167-8191(00)00048-x
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.
