Good characterization for path packing in a subclass of Karzanov networks

TL;DR

This paper investigates the path packing problem in a specific subclass of Karzanov networks, aiming to identify conditions for optimal path packing in complex network structures.

Contribution

It provides a new characterization for path packing solutions within a particular subclass of Karzanov networks, advancing understanding of network flow optimization.

Findings

Established a characterization criterion for path packing in the subclass.

Demonstrated the applicability of the characterization to optimize path packing.

Identified conditions under which maximum edge-disjoint paths can be found.

Abstract

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.