1. Babenko, M.A., Karzanov, A.V.: Free multiflows in bidirected and skew-symmetric graphs. Discrete Applied Mathematics 155, 1715–1730 (2007)
2. Cherkassky, B.V.: A solution of a problem on multicommodity flows in a network. Ekonomika i Matematicheskie Metody 13(1), 143–151 (1977) (in Russian)
3. Dinic, E.A.: Algorithm for solution of a problem of maximum flow in networks with power estimation. Dokl. Akad. Nauk. SSSR 194, 754–757 (in Russian) (translated in Soviet Math. Dokl. 111, 277–279)
4. Edmonds, J., Johnson, E.L.: Matching: a well-solved class of integer linear programs. In: Guy, R., Hanani, H., Sauer, N., Schönhein, J. (eds.) Combinatorial Structures and Their Applications, pp. 89–92. Gordon and Breach, NY (1970)
5. Even, S., Tarjan, R.E.: Network Flow and Testing Graph Connectivity. SIAM Journal on Computing 4, 507–518 (1975)