Shortest paths on dynamic graphs (Q3638853): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1111/j.1475-3995.2008.00649.x / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/j.1475-3995.2008.00649.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2166460706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic shortest paths minimizing travel times and costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual Shortest Path Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding Up Dynamic Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest route through a network with time-dependent internodal transit times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Etude Et Extension D’Un Algorithme De Murghland / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization procedures in shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Techniques in Transportation Planning<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized permanent label setting algorithm for the shortest path between specified nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for reoptimizing shortest paths when the arc costs change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in Euclidean graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1111/J.1475-3995.2008.00649.X / rank
 
Normal rank

Latest revision as of 14:13, 21 December 2024

scientific article
Language Label Description Also known as
English
Shortest paths on dynamic graphs
scientific article

    Statements

    Shortest paths on dynamic graphs (English)
    0 references
    0 references
    0 references
    28 October 2009
    0 references
    shortest paths
    0 references
    dynamic graph
    0 references
    road network
    0 references

    Identifiers