/

Good characterization for path packing in a subclass of Karzanov networks

N. Vanetik
Arxiv ID: 0912.1452Last updated: 8/3/2020
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.

PaperStudio AI Chat

I'm your research assistant! Ask me anything about this paper.

Related papers

About
Pricing
Commercial Disclosure
Contact
© 2023 Paper Studio™. All Rights Reserved.