The DOI matches its Crossref record.
An Algorithm for Partitioning the Nodes of a Graph
Abstract
Let $G = \{ N,E \}$ be an undirected graph having nodes N and edges E. We consider the problem of partitioning N into k disjoint subsets $N_1 , \cdots ,N_k $ of given sizes $m_1 , \cdots ,m_k $, respectively, in such a way that the number of edges in E that connect different subsets is minimal. We obtain a heuristic solution from the solution of a linear programming transportation problem.
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
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Alizadeh, F. (1995) · SIAM Journal on Optimization · doi:10.1137/0805002 · Cited by 892
Metadata
- Authors
- Barnes, E. R.
- Venue
- SIAM Journal on Algebraic Discrete Methods
- Published
- 1982-12
- Volume
- 3
- Issue
- 4
- Pages
- 541-550
- ISSN
- 0196-5212 (ISSN-L)
- 2168-345X
- OpenAlex
- W2035409768
- Cited by
- 299
- References
- 0
- FWCI
- 3.00
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Algorithm for Partitioning the Nodes of a Graph. https://app.cochat.ai/papers/10.1137/0603056
- The paper
- Barnes, E. R. (1982). An Algorithm for Partitioning the Nodes of a Graph. SIAM Journal on Algebraic Discrete Methods. https://doi.org/10.1137/0603056
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.
