A Good Algorithm for Edge-Disjoint Branching

[1]  Eugene L. Lawler,et al.  Matroid intersection algorithms , 1975, Math. Program..

[2]  Robert E. Tarjan,et al.  Testing graph connectivity , 1974, STOC '74.

[3]  L. Lovász.  Connectivity in digraphs , 1973 .

[4]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .