Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks (Q2828194): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1145/2670126 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2150928468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Label-Constrained Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal-Language-Constrained Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5--7, 2011. Proceedings / 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: Time-Dependent Route Planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: User-Constrained Multi-Modal Route Planning / 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: UniALT for regular language contrained shortest paths on a multi-modal transportation network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Regular Simple Paths in Graph Databases / 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: Q5679703 / 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: Shortest path under rational constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approach‐dependent, time‐dependent, label‐constrained shortest path problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:50, 12 July 2024

scientific article
Language Label Description Also known as
English
Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks
scientific article

    Statements

    Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks (English)
    0 references
    0 references
    0 references
    0 references
    24 October 2016
    0 references
    ALT
    0 references
    constrained shortest paths
    0 references
    multimodal transportation network
    0 references
    regular languages
    0 references
    shortest path
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references