Shortest-Path Problem

Discover the intricate world of graph theory with the "Shortest-Path Problem" by Hector Ortega-Arranz, published by Springer International Publishing AG in 2014. This informative paperback spans 71 pages and delves into essential concepts and algorithms that shape the field of graph theory.

The book features a comprehensive table of contents, including sections on classical algorithms, hierarchical preprocessing-dependent approaches, and non-hierarchical preprocessing-dependent approaches. Each chapter is meticulously crafted to enhance your understanding of the shortest-path problem, offering valuable insights and comparisons of various methodologies.

Whether you’re a student, researcher, or simply curious about graph theory, Ortega-Arranz’s work provides a solid foundation and a thorough analysis of the subject. Explore the bibliography and authors’ biographies to further enrich your knowledge. Don’t miss the chance to add this essential resource to your collection!