Menger's Paths with Minimum Mergings

Details Menger's Paths with Minimum Mergings Menger's Paths with Minimum Mergings

2008-05-27

arxiv.org/abs/0805.4059v4

Computer Science

Information Theory

28 pages, 7 figures

Scientific paper

For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Merger's paths between the sources and the sinks such that the number of mergings between these paths is upper bounded by a constant depending only on the min-cuts between the sources and the sinks, regardless of the size and topology of the graph. We also give bounds on the minimum number of mergings between these paths, and discuss how it depends on the min-cuts.

Affiliated with

Also associated with

No associations

Rating

Menger's Paths with Minimum Mergings 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 Menger's Paths with Minimum Mergings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Menger's Paths with Minimum Mergings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-273209