1. Balancing signed toroidal graphs in polynomial time;Barahona,1981
2. An algorithm to construct a minimum directed spanning tree in a directed network;Bock,1971
3. Matrix tree theorems;Chaiken;J. Combin. Theory (A),1978
4. On the shortest aborescence of a directed graph;Yoeng-Yin;Scientia Sinica,1965
5. Optimum branchings;Edmonds;J. Res. Nat. Bur. Standards (Sect. B),1967