dynamic shortest path
Description: A shortest-path problem in a graph or network whose edges, costs, or conditions change over time, addressed in routing and algorithm design.
Primary topic: Complexity and Algorithms in Graphs (51%)
OpenAlex ID: keywords/dynamic-shortest-path
