Show simple item record

dc.contributor.authorEnsor, A
dc.contributor.authorLillo, F
dc.date.accessioned2011-12-13T10:50:21Z
dc.date.available2011-12-13T10:50:21Z
dc.date.copyright2011
dc.date.issued2011-12-13
dc.identifier.citationarXiv:1112.3066 [math.CO]
dc.identifier.issn0166-218X (print)
dc.identifier.urihttp://hdl.handle.net/10292/3083
dc.description.abstractA weighted coloured-edge 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 coloured-edge graph. Additionally, a bound is presented on the expected number of minimal paths in weighted bicoloured-edge graphs.
dc.publisherarXiv, Cornell University
dc.relation.urihttp://arxiv.org/abs/1112.3066
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in (see Citation). The original publication is available at (see Publisher's Version)
dc.subjectGraph theory
dc.subjectMinimal paths
dc.subjectMultimodal network
dc.subjectTransportation modes
dc.subjectWeighted coloured-edge graph
dc.titleCounting the number of minimal paths in weighted coloured-edge graphs
dc.typeJournal Article
dc.rights.accessrightsOpenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record