Nondecreasing paths in a weighted graph or: how to optimally read a train schedule (Q6486953)
From MaRDI portal
scientific article; zbMATH DE number 6370681
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nondecreasing paths in a weighted graph or: how to optimally read a train schedule |
scientific article; zbMATH DE number 6370681 |
Statements
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule (English)
0 references
18 November 2014
0 references
earliest arrivals
0 references
all pairs
0 references
matrix products
0 references
nondecreasing paths
0 references
shortest paths
0 references
single source
0 references
