The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Note on Two Problems in Connexion with Graphs
Abstract
chapter Share on A Note on Two Problems in Connexion with Graphs Author: E. W. Dijkstra View Profile Authors Info & Claims Edsger Wybe Dijkstra: His Life,Work, and LegacyJuly 2022 Pages 287–290https://doi.org/10.1145/3544585.3544600Published:13 July 2022Publication History 1citation11DownloadsMetricsTotal Citations1Total Downloads11Last 12 Months11Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
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
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Formal Procedures for Connecting Terminals with a Minimum Total Wire Length
Loberman, H., & Weinberger, A. (1957) · Journal of the ACM · doi:10.1145/320893.320896 · Cited by 90
Cited by
Intelligent scissors for image composition
Mortensen, E. N., & Barrett, W. A. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218442 · Cited by 778
Knight, K., & Graehl, J. (1997) · Proceedings of the eighth conference on European chapter of the Association for Computational Linguistics - · doi:10.3115/979617.979634 · Cited by 466
Stochastic Geometry and Wireless Networks: Volume II Applications
François, B., & Błlaszczyszyn, B. (2010) · Foundations and Trends® in Networking · doi:10.1561/1300000026 · Cited by 430
COVID-19 lockdown induces disease-mitigating structural changes in mobility networks
Schlosser, F., Maier, B. F., Jack, O., Hinrichs, D., Zachariae, A., & Brockmann, D. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2012326117 · Cited by 379
Deep generative modeling for mechanistic-based learning and design of metamaterial systems
Wang, L., Chan, Y.-C., Ahmed, F., Liu, Z., Zhu, P., & Chen, W. (2020) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2020.113377 · Cited by 363
Metadata
- Authors
- Dijkstra, E. W.
- Venue
- Edsger Wybe Dijkstra
- Publisher
- ACM
- Published
- 2022-07-12
- Pages
- 287-290
- OpenAlex
- W4285092328
- Cited by
- 1,353
- References
- 2
- FWCI
- 589.80
- Type
- book chapter
- 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.