On the tractability of shortest path problems in weighted edge-coloured graphs (Q1621167)
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: On the tractability of shortest path problems in weighted edge-coloured graphs |
scientific article; zbMATH DE number 6975289
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the tractability of shortest path problems in weighted edge-coloured graphs |
scientific article; zbMATH DE number 6975289 |
Statements
On the tractability of shortest path problems in weighted edge-coloured graphs (English)
0 references
8 November 2018
0 references
edge-coloured chain graph
0 references
minimal paths
0 references
multimodal networks
0 references
Pareto set cardinality
0 references
upper bounds
0 references
