The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
The Transitive Reduction of a Directed Graph
Abstract
We consider economical representations for the path information in a directed graph. A directed graph $G^t $ is said to be a transitive reduction of the directed graph G provided that (i) $G^t $ has a directed path from vertex u to vertex v if and only if G has a directed path from vertex u to vertex v, and (ii) there is no graph with fewer arcs than $G^t $ satisfying condition (i). Though directed graphs with cycles may have more than one such representation, we select a natural canonical representative as the transitive reduction for such graphs. It is shown that the time complexity of the best algorithm for finding the transitive reduction of a graph is the same as the time to compute the transitive closure of a graph or to perform Boolean matrix multiplication.
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
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Warshall, S. (1962) · Journal of the ACM · doi:10.1145/321105.321107 · Cited by 1,683
Optimal scheduling for two-processor systems
Coffman, E. G., & Graham, R. L. (1972) · Acta Informatica · doi:10.1007/bf00288685 · Cited by 614
Boolean matrix multiplication and transitive closure
Fischer, M. J., & Meyer, A. R. (1971) · Annual Symposium on Switching & Automata Theory · doi:10.1109/swat.1971.4 · Cited by 203
A transitive closure algorithm
Purdom, P. W. (1970) · BIT Numerical Mathematics · doi:10.1007/bf01940892 · Cited by 114
Cited by
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
DepGraph: Towards Any Structural Pruning
Fang, G., Ma, X., Song, M., Bi Mi, M., & Wang, X. (2023) · 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52729.2023.01544 · Cited by 501
Li, S., Assmann, S. M., & Albert, R. (2006) · PLoS Biology · doi:10.1371/journal.pbio.0040312 · Cited by 418
Inferring cellular networks – a review
Markowetz, F., & Spang, R. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-s6-s5 · Cited by 391
Preserving and using context information in interprocess communication
Peterson, L. L., Buchholz, N. C., & Schlichting, R. D. (1989) · ACM Transactions on Computer Systems · doi:10.1145/65000.65001 · Cited by 325
Metadata
- Authors
- Aho, A. V., Garey, M. R., & Ullman, J. D.
- Venue
- SIAM Journal on Computing
- Published
- 1972-06
- Volume
- 1
- Issue
- 2
- Pages
- 131-137
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2110920860
- Cited by
- 718
- References
- 6
- FWCI
- 2.23
- 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.