The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A fast algorithm for Steiner trees
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
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
Floyd, R. W. (1962) · Communications of the ACM · doi:10.1145/367766.368168 · Cited by 3,998
Gilbert, E. N., & Pollak, H. O. (1968) · SIAM Journal on Applied Mathematics · doi:10.1137/0116001 · Cited by 690
Finding Minimum Spanning Trees
Cheriton, D. R., & Tarjan, R. E. (1976) · SIAM Journal on Computing · doi:10.1137/0205051 · Cited by 428
On Steiner Minimal Trees with Rectilinear Distance
Hwang, F. K. (1976) · SIAM Journal on Applied Mathematics · doi:10.1137/0130013 · Cited by 424
Some NP-complete geometric problems
Garey, M. R., Graham, R. L., & Johnson, D. S. (1976) · Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 · doi:10.1145/800113.803626 · Cited by 400
Cited by
Routing of multipoint connections
Waxman, B. M. (1988) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.12889 · Cited by 2,885
Chen, S., & Nahrstedt, K. (1998) · IEEE Network · doi:10.1109/65.752646 · Cited by 874
New directions in communications (or which way to the information age?)
Turner, J. (1986) · IEEE Communications Magazine · doi:10.1109/mcom.1986.1092946 · Cited by 850
Hwang, F. K., & Richards, D. S. (1992) · Networks · doi:10.1002/net.3230220105 · Cited by 663
The PIM architecture for wide-area multicast routing
Deering, S., Estrin, D. L., Farinacci, D., Jacobson, V., Liu, C.-G., & Wei, L. (1996) · IEEE/ACM Transactions on Networking · doi:10.1109/90.490743 · Cited by 655
Metadata
- Authors
- Kou, L., Markowsky, G., & Berman, L.
- Venue
- Acta Informatica
- Published
- 1981
- Volume
- 15
- Issue
- 2
- Pages
- 141-145
- ISSN
- 0001-5903 (ISSN-L)
- 1432-0525
- OpenAlex
- W1975290397
- Cited by
- 1,188
- References
- 7
- FWCI
- 2.27
- 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.