{"id":"https://openalex.org/keywords/dynamic-shortest-path","display_name":"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.","display_name_alternatives":["dynamic shortest paths","dynamic shortest-path problem","dynamic shortest-path problems"],"ids":{"openalex":"https://openalex.org/keywords/dynamic-shortest-path","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5127,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5127,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.1273,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"works_count":191,"cited_by_count":3898,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/dynamic-shortest-path","updated_date":"2026-11-20T04:06:44","created_date":"2026-09-30T00:00:00"}
