Efficient algorithms to find optimal paths in a public transportation network (Q4338573)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1014868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms to find optimal paths in a public transportation network |
scientific article; zbMATH DE number 1014868 |
Statements
Efficient algorithms to find optimal paths in a public transportation network (English)
0 references
28 May 1997
0 references
public transportation routing
0 references
directed acyclic graphs
0 references
0.9017172
0 references
0.9010654
0 references
0 references
0 references
0.8903503
0 references
0 references
0.8810036
0 references
0.8782166
0 references
0.8744798
0 references
