Trip-Based Public Transit Routing (Q3452863): 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 / OpenAlex ID
 
Property / OpenAlex ID: W3101068778 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1504.07149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering graph-based models for dynamic timetable information systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation of best connections in public transportation networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intriguingly Simple and Fast Transit Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cardinality of the Pareto set in bicriteria shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient models for timetable information in public transportation systems / rank
 
Normal rank

Latest revision as of 03:16, 11 July 2024

scientific article
Language Label Description Also known as
English
Trip-Based Public Transit Routing
scientific article

    Statements

    Identifiers

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