From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows

From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows

An s-branching flow f in a network N = (D, u), where u is the capacity function, is a flow thatreaches every vertex in V(D) from s while loosing exactly one unit of flow in each vertex other thans. Bang-Jensen and Bessy [TCS, 2014] showed that, when every arc has capacity n − 1, a network Nadmits k...

Full description

Bibliographic Details
Main Authors: Cláudio Carvalho, Jonas Costa, Raul Lopes, Ana Karolinna Maia, Nicolas Nisse, Cláudia Sales
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2023-05-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
digraphs
branchings
branching flows
arc-disjoint flows
[math]mathematics [math]
[info.info-cc]computer science [cs]/computational complexity [cs.cc]
[info.info-ds]computer science [cs]/data structures and algorithms [cs.ds]
[math.math-co]mathematics [math]/combinatorics [math.co]
Online Access:https://dmtcs.episciences.org/9302/pdf

Internet

https://dmtcs.episciences.org/9302/pdf

Similar Items