The DOI matches its Crossref record.
An Algorithm for Path Connections and Its Applications
Abstract
The algorithm described in this paper is the outcome of an endeavor to answer the following question: Is it possible to find procedures which would enable a computer to solve efficiently path-connection problems inherent in logical drawing, wiring diagramming, and optimal route finding? The results are highly encouraging. Within our framework, we are able to solve the following types of problems: 1) To find a path between two points so that it crosses the least number of existing paths. 2) To find a path between two points so that it avoids as much as possible preset obstacles such as edges. 3) To find a path between two points so that the path is optimal with respect to several properties; for example, a path which is not only one of those which cross the fewest number of existing paths, but, among these, is also one of the shortest. The minimal-distance solution has been programmed on an IBM 704 computer, and a number of illustrations are presented. The class of problems solvable by our algorithm is given in a theorem in Section III. A byproduct of this algorithm is a somewhat remote, but unexpected, relation to physical optics. This is discussed in Section VI.
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
Cited by
VPR: a new packing, placement and routing tool for FPGA research
Betz, V., & Rose, J. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63465-7_226 · Cited by 1,123
STAMP: Stanford Transactional Applications for Multi-Processing
Minh, C. C., Chung, J., Kozyrakis, C., & Olukotun, K. (2008) · 2008 IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc.2008.4636089 · Cited by 873
Computer‐Assisted Synthetic Planning: The End of the Beginning
Szymkuć, S., Gajewska, E. P., Klucznik, T., Molga, K., Dittwald, P., Startek, M., Bajczyk, M., & Grzybowski, B. A. (2016) · Angewandte Chemie International Edition · doi:10.1002/anie.201506101 · Cited by 611
Preventing advanced persistent threats in complex control networks
Rubio, J. E., Alcaraz, C., & Lopez, J. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-66399-9_22 · Cited by 27
Metadata
- Authors
- Lee, C. Y.
- Venue
- IEEE Transactions on Electronic Computers
- Published
- 1961-09
- Volume
- EC-10
- Issue
- 3
- Pages
- 346-365
- ISSN
- 0367-7508 (ISSN-L)
- OpenAlex
- W2153580689
- Cited by
- 1,619
- References
- 0
- FWCI
- 2.85
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Algorithm for Path Connections and Its Applications. https://app.cochat.ai/papers/10.1109/tec.1961.5219222
- The paper
- Lee, C. Y. (1961). An Algorithm for Path Connections and Its Applications. IEEE Transactions on Electronic Computers. https://doi.org/10.1109/tec.1961.5219222
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.
