Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-nmvwc Total loading time: 0 Render date: 2024-07-06T11:54:56.382Z Has data issue: false hasContentIssue false

1 - Paths in Graphs

Published online by Cambridge University Press:  05 June 2012

Guy Even
Affiliation:
Tel-Aviv University
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Graph Algorithms , pp. 1 - 28
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Golomb, S. W., Shift Register Sequences, Holden-Day, 1967.Google Scholar
[2] Moore, E. F., “The Shortest Path Through a Maze,” Proc. Iternat. Symp. Switching Th., 1957, Part II, Harvard Univ. Press, 1959, pp. 285–292.Google Scholar
[3] Dijkstra, E. W., “A Note on Two Problems in Connexion with Graphs,” Numerische Math., Vol. 1, 1959, pp. 269–271.CrossRefGoogle Scholar
[4] Cormen, T. H., C. E., Leiserson, and R. L., Rivest, Introduction to Algorithms, The MIT Press, 1990.Google Scholar
[5] Fredman, M. L., and R. E., Tarjan, “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] Ford, L. R. Jr., “Network Flow Theory,” The Rand Corporation, P-923, August, 1956.
[7] Ford, L. R. Jr., and D. R. Fulkerson, D. R., Flows in Networks, Princeton University Press, 1962, Chap. III, Sec. 5.Google Scholar
[8] Johnson, D. B., “A Note on Dijkstra's Shortest Path Algorithm,” J. of the ACM, Vol. 20, No. 3, 1973, pp. 385–388.CrossRefGoogle Scholar
[9] Floyd, R. W., “Algorithm 97: Shortest Path,” Comm. of the ACM, Vol. 5, 1962, p. 345.CrossRefGoogle Scholar
[10] Ore, O., “A Problem Regarding the Tracing of Graphs,” Elem. Math., Vol. 6, 1951, pp. 49–53.Google Scholar
[11] Bhatt, S., D., Greenberg, S., Even, and R., Tayar, “Traversing Directed Eulerian Mazes,” J. of Graph Algorithms and Applications, Vol. 6, No. 2, 2002, pp. 157–173.CrossRefGoogle Scholar
[12] Dirac, G. A., “Connectivity Theorems for Graphs,” Quart. J. of Math., Ser. (2), Vol. 3, 1952, pp. 171–174.CrossRefGoogle Scholar
[13] Warshall, S., “A Theorem on Boolean Matrices,” J. of the ACM, Vol. 9, No. 1, 1962, pp. 11–12.CrossRefGoogle Scholar
[14] Dantzig, G. B., “All Shortest Routes in a Graph,” Oper. Res. House, Stanford University Tech. Rep. 66–3, November 1966.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Paths in Graphs
  • Shimon Even
  • Edited by Guy Even, Tel-Aviv University
  • Book: Graph Algorithms
  • Online publication: 05 June 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9781139015165.004
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Paths in Graphs
  • Shimon Even
  • Edited by Guy Even, Tel-Aviv University
  • Book: Graph Algorithms
  • Online publication: 05 June 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9781139015165.004
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Paths in Graphs
  • Shimon Even
  • Edited by Guy Even, Tel-Aviv University
  • Book: Graph Algorithms
  • Online publication: 05 June 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9781139015165.004
Available formats
×