Mostrar el registro sencillo de la publicación

dc.contributor.authorEnsor, Andrew
dc.contributor.authorLillo-Viedma, Felipe
dc.date.accessioned2018-04-25T13:03:10Z
dc.date.available2018-04-25T13:03:10Z
dc.date.issued2018
dc.identifier.urihttp://repositorio.ucm.cl/handle/ucm/1724
dc.description.abstractA weighted edge-coloured graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such a graph paths are compared by their total weight in each colour, resulting in a Pareto set of minimal paths from one vertex to another. This paper will give a tight upper bound on the cardinality of a minimal set of paths for any weighted edge-coloured graph. Additionally, a bound is presented on the expected number of minimal paths in weighted edge– bicoloured graphs. These bounds indicate that despite weighted edge-coloured graphs are theoretically intractable, amenability to computation is typically found in practice.es_CL
dc.language.isoenes_CL
dc.rightsAtribución-NoComercial-SinDerivadas 3.0 Chile*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/*
dc.sourceJournal of Systems Science and Complexity, 31(2), 527–538es_CL
dc.subjectEdge-coloured chain graphes_CL
dc.subjectMultimodal networkses_CL
dc.subjectPareto set cardinalityes_CL
dc.titleOn the tractability of shortest path problems in weighted edge-coloured graphses_CL
dc.typeArticlees_CL
dc.ucm.facultadFacultad de Ciencias Sociales y Económicases_CL
dc.ucm.indexacionScopuses_CL
dc.ucm.indexacionIsies_CL
dc.ucm.urisibib2.ucm.cl:2048/login?url=https://link.springer.com/article/10.1007%2Fs11424-017-6138-0es_CL
dc.ucm.doidoi.org/10.1007/s11424-017-6138-0es_CL


Ficheros en la publicación

FicherosTamañoFormatoVer

No hay ficheros asociados a esta publicación.

Esta publicación aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo de la publicación

Atribución-NoComercial-SinDerivadas 3.0 Chile
Excepto si se señala otra cosa, la licencia de la publicación se describe como Atribución-NoComercial-SinDerivadas 3.0 Chile