On the tractability of shortest path problems in weighted edge-coloured graphs
type: Item
instance of: scholarly article
title: On the tractability of shortest path problems in weighted edge-coloured graphs
zbMATH Open document ID: 1402.05121
author: Andrew Ensor
author: Felipe Lillo
published in: Journal of Systems Science and Complexity
publication date: 2018-11-08T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6975289
zbMATH Keywords: edge-coloured chain graph
zbMATH Keywords: minimal paths
zbMATH Keywords: multimodal networks
zbMATH Keywords: Pareto set cardinality
zbMATH Keywords: upper bounds
MaRDI profile type: Publication
full work available at URL: s11424-017-6138-0
OpenAlex ID: W2618092212
cites work: Colored-edge graph approach for the modeling of multimodal transportation systems
cites work: On the bicriterion - minimal cost/minimal label - spanning tree problem
cites work: A matrix-based approach to searching colored paths in a weighted colored multidigraph
cites work: Alternating paths in edge-colored complete graphs
cites work: Alternating cycles and paths in edge-coloured multigraphs: A survey
cites work: Smoothed Analysis of Integer Programming
cites work: The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
DOI: 10.1007/S11424-017-6138-0
description: scientific article; zbMATH DE number 6975289