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

DOI10.46298/DMTCS.9302OpenAlexW4285581559MaRDI QIDQ6131788FDOQ6131788

Authors: Raul Lopes, Ana Karolinna Maia, Nicolas Nisse, Cláudia L. Sales 

Publication date: 18 April 2024

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.46298/dmtcs.9302

Recommendations

• The complexity of finding arc-disjoint branching flows
• (Arc-)disjoint flows in networks
• The \(b\)-branching problem in digraphs
• Packing branchings under cardinality constraints on their root sets
• scientific article; zbMATH DE number 7378329

zbMATH Keywords

digraphsbranchingsbranching flowsarc-disjoint flows

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Flows in graphs (05C21)

This page was built for publication: From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131788)