1 - Paths in Graphs
Published online by Cambridge University Press: 05 June 2012
Edited by
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Graph Algorithms , pp. 1 - 28Publisher: Cambridge University PressPrint publication year: 2011
References
[2] , “The Shortest Path Through a Maze,” Proc. Iternat. Symp. Switching Th., 1957, Part II, Harvard Univ. Press, 1959, pp. 285–292.Google Scholar
[3] , “A Note on Two Problems in Connexion with Graphs,” Numerische Math., Vol. 1, 1959, pp. 269–271.CrossRefGoogle Scholar
[5] , and , “Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms,” J. of the ACM, Vol. 34, No. 3, 1987, pp. 596–615.CrossRefGoogle Scholar
[6] , “Network Flow Theory,” The Rand Corporation, P-923, August, 1956.
[7] , and D. R. , Flows in Networks, Princeton University Press, 1962, Chap. III, Sec. 5.Google Scholar
[8] , “A Note on Dijkstra's Shortest Path Algorithm,” J. of the ACM, Vol. 20, No. 3, 1973, pp. 385–388.CrossRefGoogle Scholar
[10] , “A Problem Regarding the Tracing of Graphs,” Elem. Math., Vol. 6, 1951, pp. 49–53.Google Scholar
[11] , , , and , “Traversing Directed Eulerian Mazes,” J. of Graph Algorithms and Applications, Vol. 6, No. 2, 2002, pp. 157–173.CrossRefGoogle Scholar
[12] , “Connectivity Theorems for Graphs,” Quart. J. of Math., Ser. (2), Vol. 3, 1952, pp. 171–174.CrossRefGoogle Scholar
[13] , “A Theorem on Boolean Matrices,” J. of the ACM, Vol. 9, No. 1, 1962, pp. 11–12.CrossRefGoogle Scholar
[14] , “All Shortest Routes in a Graph,” Oper. Res. House, Stanford University Tech. Rep. 66–3, November 1966.Google Scholar