Author:
Bérczi Kristóf,Fujishige Satoru,Kamiyama Naoyuki
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference11 articles.
1. Edge-disjoint in- and out-branchings in tournaments and related path problems;Bang-Jensen;J. Combin. Theory Ser. B,1991
2. Variations for Lovász' submodular ideas;Bérczi,2008
3. A. Bhalgat, R. Hariharan, T. Kavitha, D. Panigrahi, Fast edge splitting and Edmonds' arborescence construction for unweighted graphs, in: Proceedings of the Nineteenth Annual ACM–SIAM Symposium on Discrete Algorithms (SODA2008), 2008, pp. 455–464
4. S. Fujishige, A note on disjoint arborescences, Combinatorica, in press
5. A matroid approach to finding edge connectivity packing arborescences;Gabow;J. Comput. System Sci.,1995
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献