Counting the Number of Minimal Paths in Weighted Coloured-Edge Graphs

Details Counting the Number of Minimal Paths in Weighted Coloured-Edge Graphs Counting the Number of Minimal Paths in Weighted Coloured-Edge Graphs

2011-12-13

arxiv.org/abs/1112.3066v1

Mathematics

Combinatorics

Scientific paper

A 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.

Affiliated with

Also associated with

No associations

Rating

Counting the Number of Minimal Paths in Weighted Coloured-Edge Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting the Number of Minimal Paths in Weighted Coloured-Edge Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting the Number of Minimal Paths in Weighted Coloured-Edge Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-224990