Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks (Q5505661): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1527469337 / 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: An Appraisal of Some Shortest-Path Algorithms / 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: Reach for <i>A</i>*: Efficient Point-to-Point Shortest Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Route Planning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Goal Directed Shortest Path Queries Using Precomputed Cluster Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast paths in large-scale dynamic road networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed-Up Techniques for Shortest-Path Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental algorithms. 6th international workshop, WEA 2007, Rome, Italy, June 6--8, 2007. Proceedings. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:54, 29 June 2024

scientific article; zbMATH DE number 5498458
Language Label Description Also known as
English
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
scientific article; zbMATH DE number 5498458

    Statements