Good characterization for path packing in a subclass of Karzanov networks
Discrete Mathematics
2020-08-03 v2
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.
Keywords
Cite
@article{arxiv.0912.1452,
title = {Good characterization for path packing in a subclass of Karzanov networks},
author = {N. Vanetik},
journal= {arXiv preprint arXiv:0912.1452},
year = {2020}
}
Comments
While correct, this was deemed uninteresting by a journal