Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks (Q2828194): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 18:57, 19 March 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
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
