A linear time implementation of the reverse Cuthill-McKee algorithm
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Clever partitioning of circuits can achieve good parallelism and efficient use of distributed memory resources for particular supercomputer architectures.
“Clever partitioning of circuits can achieve good parallelism and efficient use of distributed memory resources for particular supercomputer architectures [21-27].”
From Validating quantum computers using randomized model circuits (2019) · cites this paper as [27]
Cites
Reducing the bandwidth of sparse symmetric matrices
Cuthill, E., & McKee, J. (1969) · doi:10.1145/800195.805928 · Cited by 1,472 · see citing works
The Theory of Graphs and Its Applications
Burger, E., Berge, C., & Doig, A. (1965) · Econometrica · doi:10.2307/1911908 · Cited by 905 · see citing works
An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
Gibbs, N. E., Poole, W. G., & Stockmeyer, P. K. (1976) · SIAM Journal on Numerical Analysis · doi:10.1137/0713023 · Cited by 593 · see citing works
An Implementation of a Pseudoperipheral Node Finder
George, A. D., & Liu, J. W. H. (1979) · ACM Transactions on Mathematical Software · doi:10.1145/355841.355845 · Cited by 121 · see citing works
Self-citationAlgorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems
George, A. D., & Liu, J. W. H. (1978) · SIAM Journal on Numerical Analysis · doi:10.1137/0715021 · Cited by 70 · see citing works
Self-citationOn reducing the profile of sparse symmetric matrices.
Liu, J. W.-H. (1976) · Cited by 11 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Validating quantum computers using randomized model circuits
Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D., & Gambetta, J. M. (2019) · Physical Review A · doi:10.1103/physreva.100.032328 · Cited by 704 · see citing works
- Authors
- Chan, W. M., & George, A.
- Affiliations
- University of Waterloo (CA)
- ORCID
- George, Alan
- Venue
- BIT Numerical Mathematics
- Published
- 1980-03
- Volume
- 20
- Issue
- 1
- Pages
- 8-14
- ISSN
- 0006-3835 (ISSN-L)
- 1572-9125
- OpenAlex
- W2024029196
- Cited by
- 80
- References
- 6
- Citations by year
- 2026: 3 · 2025: 4 · 2023: 1 · 2022: 5 · 2021: 7 · 2020: 5 · 2019: 2 · 2018: 3 · 2017: 2 · 2016: 4 · 2015: 3 · 2014: 2 · 2013: 1 · 2012: 7
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- BIT Numerical Mathematics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Keywords
- sparse matrix reordering, graph bandwidth, runtime complexity
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
