Good characterization for path packing in a subclass of Karzanov networks
arXiv:0912.1452
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.
arXiv commentWhile correct, this was deemed uninteresting by a journal