# An Algorithm for Path Connections and Its Applications

@article{Lee1961AnAF, title={An Algorithm for Path Connections and Its Applications}, author={C. Y. Lee}, journal={IRE Trans. Electron. Comput.}, year={1961}, volume={10}, pages={346-365} }

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… CONTINUE READING

#### Topics from this paper.

1,392 Citations

A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

- Computer Science, Mathematics
- 2009

- 59
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-2 OF 2 REFERENCES