Author:
Bang-Jensen J.,Havet Frédéric,Yeo Anders
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference14 articles.
1. Network Flows;Ahuja,1993
2. (Arc-)disjoint flows in networks;Bang-Jensen;Theoret. Comput. Sci.,2014
3. Digraphs: Theory, Algorithms and Applications;Bang-Jensen,2009
4. Balanced branchings in digraphs;Bang-Jensen;Theoret. Comput. Sci.,2015
5. FPT Algorithms and Kernels for the Directed k-Leaf Problem;Daligault;J. Comput. System Sci.,2010
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Constrained flows in networks;Theoretical Computer Science;2024-09
2. FPT algorithms for packing k-safe spanning rooted sub(di)graphs;Discrete Applied Mathematics;2024-03
3. Balancing Connected Colourings of Graphs;The Electronic Journal of Combinatorics;2023-03-24
4. Globally balancing spanning trees;European Journal of Combinatorics;2023-03
5. An Example of the Bound of Double Tree;Advances in Applied Mathematics;2023