Time-dependent SHARC-routing (Q547279): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-009-9341-0 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-009-9341-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4234928733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHARC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847380 / 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: Time-Dependent SHARC-Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Route Planning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3574265 / 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: Q2921666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3574261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3574259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs to speedup Dijkstra's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirectional A  ∗  Search for Time-Dependent Fast Paths / 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: Q2847388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient models for timetable information in public transportation systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Highway Hierarchies / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-009-9341-0 / rank
 
Normal rank

Latest revision as of 21:10, 9 December 2024

scientific article
Language Label Description Also known as
English
Time-dependent SHARC-routing
scientific article

    Statements

    Time-dependent SHARC-routing (English)
    0 references
    0 references
    0 references
    1 July 2011
    0 references
    algorithm engineering
    0 references
    graph algorithms
    0 references
    time-dependent shortest paths
    0 references
    timetable information
    0 references
    0 references
    0 references
    0 references

    Identifiers