Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length (Q3477968)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:3477968 |
scientific article; zbMATH DE number 4147521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length |
scientific article; zbMATH DE number 4147521 |
Statements
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length (English)
0 references
1990
0 references
computations on discrete structures
0 references
graph algorithms
0 references
path and
0 references
circuit problems
0 references
network algorithms
0 references
shortest paths
0 references
functional
0 references
complexity
0 references
time dependency
0 references
waiting times
0 references
0.8691401481628418
0 references
0.8686110973358154
0 references
0.8645974397659302
0 references
0.8621939420700073
0 references
