The DOI matches its Crossref record.
A Theorem on Boolean Matrices
Abstract
No abstract available.
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
No references could be resolved yet.
Research works printed but not linked: 2
- 1959, Proc. Eastern Joint Comput. Conf. No. 16
- 10.1145/320964.320973 · doi:10.1145/320964.320973
Cited by
Collaboration Processes: Inside the Black Box
Thomson, A. M., & Perry, J. L. (2006) · Public Administration Review · doi:10.1111/j.1540-6210.2006.00663.x · Cited by 1,386
The Nonparametric Approach to Demand Analysis
Varian, H. R. (1982) · Econometrica · doi:10.2307/1912771 · Cited by 1,131
Efficient Algorithms for Shortest Paths in Sparse Networks
Johnson, D. B. (1977) · Journal of the ACM · doi:10.1145/321992.321993 · Cited by 1,041
An Appraisal of Some Shortest-Path Algorithms
Dreyfus, S. E. (1969) · Operations Research · doi:10.1287/opre.17.3.395 · Cited by 1,002
Trust Management for the Semantic Web
Richardson, M., Agrawal, R., & Domingos, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39718-2_23 · Cited by 982
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
Shortest-Path Kernels on Graphs
Borgwardt, K. M., & Kriegel, H. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.132 · Cited by 837
Chiu, S. J., Li, X. T., Nicholas, P., Toth, C. A., Izatt, J. A., & Farsiu, S. (2010) · Optics Express · doi:10.1364/oe.18.019413 · Cited by 733
The Transitive Reduction of a Directed Graph
Aho, A. V., Garey, M. R., & Ullman, J. D. (1972) · SIAM Journal on Computing · doi:10.1137/0201008 · Cited by 718
What you always wanted to know about Datalog (and never dared to ask)
Ceri, S., Gottlob, G., & Tanca, L. (1989) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.43410 · Cited by 700
Social Media Mining: An Introduction
Zafarani, R., Abbasi, M. A., & Liu, H. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139088510 · Cited by 592
False rumors detection on Sina Weibo by propagation structures
Wu, K., Yang, S., & Zhu, K. Q. (2015) · 2015 IEEE 31st International Conference on Data Engineering · doi:10.1109/icde.2015.7113322 · Cited by 585
Non-Parametric Tests of Consumer Behaviour
Varian, H. R. (1983) · The Review of Economic Studies · doi:10.2307/2296957 · Cited by 483
Detecting causal relationships in distributed computations: In search of the holy grail
Schwarz, R., & Mattern, F. (1994) · Distributed Computing · doi:10.1007/bf02277859 · Cited by 430
Series in Machine Perception and Artificial Intelligence
(2012) · Series in machine perception and artificial intelligence · doi:10.1142/smpai · Cited by 365
Gallo, G., & Pallottino, S. (1988) · Annals of Operations Research · doi:10.1007/bf02288320 · Cited by 352
Bagnall, A. J., Rayward-Smith, V. J., & Whittley, I. M. (2001) · Information and Software Technology · doi:10.1016/s0950-5849(01)00194-x · Cited by 311
Xu, Y., Quan, R., Xu, W., Huang, Y., Chen, X., & Liu, F. (2024) · Bioengineering · doi:10.3390/bioengineering11101034 · Cited by 310
State of the art in pattern recognition
Nagy, G. (1968) · Proceedings of the IEEE · doi:10.1109/proc.1968.6414 · Cited by 293
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Semiring Frameworks and Algorithms for Shortest-Distance Problems
Mohri, M. (2002) · doi:10.25596/jalc-2002-321 · Cited by 254
A Unified Approach to Path Problems
Tarjan, R. E. (1981) · Journal of the ACM · doi:10.1145/322261.322272 · Cited by 253
A simple and efficient connected components labeling algorithm
Di Stefano, L., & Bulgarelli, A. (2003) · Proceedings 10th International Conference on Image Analysis and Processing · doi:10.1109/iciap.1999.797615 · Cited by 252
Modeling Cyber-Physical Vulnerability of the Smart Grid With Incomplete Information
Srivastava, A., Morris, T., Ernster, T., Vellaithurai, C., Pan, S., & Adhikari, U. (2013) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2012.2232318 · Cited by 169
Trade Costs, CO2, and the Environment
Shapiro, J. S. (2016) · American Economic Journal: Economic Policy · doi:10.1257/pol.20150168 · Cited by 116
Extracting Success from IBM’s 20-Qubit Machines Using Error-Aware Compilation
Nishio, S., Pan, Y., Satoh, T., Amano, H., & Meter, R. V. (2020) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3386162 · Cited by 114
Lu, M., Taiebat, M., Xu, M., & Hsu, S.-C. (2018) · Journal of Urban Planning and Development · doi:10.1061/(asce)up.1943-5444.0000469 · Cited by 62
Chung, H.-K., Tymula, A., & Glimcher, P. (2017) · The Journal of Neuroscience · doi:10.1523/jneurosci.1171-17.2017 · Cited by 40
Navigating the link between processing speed and network communication in the human brain
Imms, P., Domínguez D, J. F., Burmester, A., Seguin, C., Clemente, A., Dhollander, T., Wilson, P. H., Poudel, G., & Caeyenberghs, K. (2021) · Brain Structure and Function · doi:10.1007/s00429-021-02241-8 · Cited by 39
Metadata
- Authors
- Warshall, S.
- Venue
- Journal of the ACM
- Published
- 1962-01
- Volume
- 9
- Issue
- 1
- Pages
- 11-12
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2104734478
- Cited by
- 1,683
- References
- 0
- FWCI
- 4.95
- 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.