@inbook{cbe39b5610b346b6918202a2b608968a,
title = "Optimal Paths in Directed Graphs",
abstract = "The problem of path length minimization in graphs is very well known. There are algorithms solving this problem based on a greedy approach such as Dijkstra{\textquoteright}s algorithm [2], algorithms based on a dynamic programming approach such as Floyd-Warshall algorithm [3, 6], etc.",
author = "Michal Mankowski and Mikhail Moshkov",
note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.",
year = "2021",
doi = "10.1007/978-3-030-63920-4_7",
language = "English (US)",
series = "Studies in Systems, Decision and Control",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "75--86",
booktitle = "Studies in Systems, Decision and Control",
address = "Germany",
}