Good characterization for path packing in a subclass of Karzanov networks

Details Good characterization for path packing in a subclass of Karzanov networks Good characterization for path packing in a subclass of Karzanov networks

2009-12-08

arxiv.org/abs/0912.1452v1

Computer Science

Discrete Mathematics

17 pages, 12 figures

Scientific paper

The path packing problem is stated finding the maximum number of edge-disjoint paths between predefined pairs of nodes in an undirected multigraph. Such a multigraph together with predefined node pairs is often called a network. While in general the path packing problem is NP-hard, there exists a class of networks for which the hope of better solution for the path packing problem exists. In this paper we prove a combinatorial max-min theorem (also called a good characterization) for a wide class of such networks, thus showing that the path packing problem for this class of networks is in co-NP.

Affiliated with

Also associated with

No associations

Rating

Good characterization for path packing in a subclass of Karzanov networks 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 Good characterization for path packing in a subclass of Karzanov networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Good characterization for path packing in a subclass of Karzanov networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-385779