The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Algorithmic Aspects of Vertex Elimination on Graphs
Abstract
We consider a graph-theoretic elimination process which is related to performing Gaussian elimination on sparse symmetric positive definite systems of linear equations. We give a new linear-time algorithm to calculate the fill-in produced by any elimination ordering, and we give two new related algorithms for finding orderings with special properties. One algorithm, based on breadth-first search, finds a perfect elimination ordering, if any exists, in $O(n + e)$ time, if the problem graph has n vertices and e edges. An extension of this algorithm finds a minimal (but not necessarily minimum) ordering in $O(ne)$ time. We conjecture that the problem of finding a minimum ordering is NP-complete
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
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
Knuth, D. E. (1973) · Cumulative Index of Computer Aided Architectural Design · Cited by 1,719
Incidence matrices and interval graphs
Fulkerson, D., & Gross, O. (1965) · Pacific Journal of Mathematics · doi:10.2140/pjm.1965.15.835 · Cited by 1,262
Nested Dissection of a Regular Finite Element Mesh
George, A. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710032 · Cited by 1,064
Dirac, G. A. (1961) · Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg · doi:10.1007/bf02992776 · Cited by 927
Parallel Sequencing and Assembly Line Problems
Hu, T. C. (1961) · Operations Research · doi:10.1287/opre.9.6.841 · Cited by 898
Optimal scheduling for two-processor systems
Coffman, E. G., & Graham, R. L. (1972) · Acta Informatica · doi:10.1007/bf00288685 · Cited by 614
A Characterization of Comparability Graphs and of Interval Graphs
Gilmore, P. C., & Hoffman, A. J. (1964) · Canadian Journal of Mathematics · doi:10.4153/cjm-1964-055-5 · Cited by 588
Triangulated graphs and the elimination process
Rose, D. J. (1970) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(70)90282-9 · Cited by 500
Self-citationRose, D. J. (1972) · Elsevier eBooks · doi:10.1016/b978-1-4832-3187-7.50018-0 · Cited by 449
Self-citationAlgorithmic Aspects of Vertex Elimination on Directed Graphs
Rose, D. J., & Tarjan, R. E. (1978) · SIAM Journal on Applied Mathematics · doi:10.1137/0134014 · Cited by 160
Self-citationScheduling Graphs on Two Processors
Sethi, R. (1976) · SIAM Journal on Computing · doi:10.1137/0205005 · Cited by 78
An algorithm for testing chordality of graphs
Gavril, P. (1975) · Information Processing Letters · doi:10.1016/0020-0190(75)90043-5 · Cited by 11
Cited by
Lauritzen, S. L., & Spiegelhalter, D. J. (1988) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1988.tb01721.x · Cited by 3,902
Booth, K. S., & Lueker, G. S. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80045-1 · Cited by 1,488
Self-citationBomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Tarjan, R. E., & Yannakakis, M. (1984) · SIAM Journal on Computing · doi:10.1137/0213035 · Cited by 1,058
Self-citationA Linear Recognition Algorithm for Cographs
Corneil, D. G., Perl, Y., & Stewart, L. K. (1985) · SIAM Journal on Computing · doi:10.1137/0214065 · Cited by 636
Metadata
- Authors
- Rose, D. J., Tarjan, R. E., & Lueker, G. S.
- Venue
- SIAM Journal on Computing
- Published
- 1976-06
- Volume
- 5
- Issue
- 2
- Pages
- 266-283
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2086119402
- Cited by
- 1,203
- References
- 15
- FWCI
- 9.13
- 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.