1. Y. Birk and J. B. Lotspiech, A fast algorithm for connecting grid points to the boundary with nonintersecting straight lines,Proceedings of the second Symposium on Discrete Algorithms, pp. 465?474 (1991).
2. J. A. Bondy and U. S. R. Murty,Graph Theory with Applications, North-Holland, Amsterdam (1977).
3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest,Introduction to Algorithms, MIT Press, Cambridge, MA (1990).
4. B. Codenetti and R. Tamassia, A network flow approach to reconfiguration of VLSI arrays,IEEE Transactions on Computers, Vol. 40, No. 1, pp. 118?121 (1991).
5. G. N. Frederickson, Fast algorithms for shortest paths in planar graphs, with applications,SIAM Journal on Computing, Vol. 16, pp. 1004?1022 (1987).