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

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. 25:1; no. Graph Theory; pp. 1 - 15
Main Authors:	Carvalho, Cláudio, Costa, Jonas, Lopes, Raul, Maia, Ana Karolinna, Nisse, Nicolas, Sales, Cláudia
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 02.05.2023 Discrete Mathematics & Theoretical Computer Science
Subjects:	[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] [math]mathematics [math] arc-disjoint flows branching flows branchings Combinatorics Computational Complexity Computer Science Data Structures and Algorithms digraphs Mathematics Branchings Branching flows Arc-disjoint flows Digraphs
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!