May 1, 2024
4 minute read
Many systems operate on the concept of a graph, a mathematical construct used to represent entities and their interconnections. Shortest Paths, a fundamental topic in computer science, involves finding efficient ways to traverse these graphs and determine the shortest distances between specific points.
Understanding Shortest Paths
1zdgis|
Find a path to becoming a Shortest Paths. Learn more at:
OpenCourser.com/topic/1zdgis/shortest
Reading list
We've selected 11 books
that we think will supplement your
learning. Use these to
develop background knowledge, enrich your coursework, and gain a
deeper understanding of the topics covered in
Shortest Paths.
Provides a comprehensive overview of network flows. It covers a variety of topics, including shortest paths, maximum flows, and minimum cost flows.
Provides a comprehensive overview of combinatorial optimization. It covers a variety of topics, including shortest paths, network flows, and matchings.
Classic text on algorithms and contains a chapter on shortest paths. It provides a comprehensive overview of the topic and is suitable for both beginners and advanced readers.
Provides a comprehensive overview of approximation algorithms. It covers a variety of topics, including shortest paths, network flows, and matchings.
Provides a unique perspective on graph algorithms by using linear algebra. It covers a variety of topics, including shortest paths, network flows, and matchings.
Provides a comprehensive overview of parallel algorithms. It covers a variety of topics, including shortest paths, network flows, and matchings.
Provides a practical guide to algorithm design and includes a section on shortest paths. It is written in a clear and concise style and is suitable for both students and practitioners.
Provides a comprehensive overview of metaheuristics. It covers a variety of topics, including shortest paths, network flows, and matchings.
Provides an introduction to parameterized algorithms, which are algorithms that take a problem parameter as input. It includes a chapter on shortest paths in parameterized graphs.
French-language introduction to graph algorithms. It covers a variety of topics, including shortest paths, network flows, and matchings.
German-language introduction to graph theory. It covers a variety of topics, including shortest paths, network flows, and matchings.
For more information about how these books relate to this course, visit:
OpenCourser.com/topic/1zdgis/shortest
Save
