The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Algorithmic Aspects of Vertex Elimination on Directed Graphs
Abstract
We consider a graph-theoretic elimination process which models Gaussian elimination on sparse systems of linear equations. We describe this process by constructive theoretical results which lead to efficient algorithms to 1) compute the fill-in produced by any elimination ordering; 2) find a perfect elimination ordering if one exists; and 3) reduce any fill-in to a minimal fill-in. We relate the complexity of these elimination problems to other well-studied problems by showing that tasks 1) and 2) are at least as time-consuming as testing whether a directed graph is transitive, and that the problem of finding a minimum ordering is $NP$-complete.
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Cited by
Algorithmic Aspects of Vertex Elimination on Graphs
Rose, D. J., Tarjan, R. E., & Lueker, G. S. (1976) · SIAM Journal on Computing · doi:10.1137/0205021 · Cited by 1,203
Self-citationTwo Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
Gustavson, F. G. (1978) · ACM Transactions on Mathematical Software · doi:10.1145/355791.355796 · Cited by 410
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Metadata
- Authors
- Rose, D. J., & Tarjan, R. E.
- Venue
- SIAM Journal on Applied Mathematics
- Published
- 1978-01
- Volume
- 34
- Issue
- 1
- Pages
- 176-197
- ISSN
- 0036-1399 (ISSN-L)
- 1095-712X
- OpenAlex
- W2089341221
- Cited by
- 160
- References
- 2
- FWCI
- 7.20
- 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
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.