Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference17 articles.
1. Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5(4), 691–703 (1976)
2. Fortune, S., Hopcroft, J.E., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10, 111–121 (1980)
3. Frank, A.: On connectivity properties of Eulerian digraphs. In: Andersen, L.D., Jakobsen, I.T., Thomassen, C., Toft, B., Vestergaard, P.D. (eds.) Graph theory in memory of GA dirac of annals of discrete mathematics, vol. 41, pp. 179–194. Elsevier, Amsterdam (1988)
4. Hu, T.C.: Multi-commodity network flows. Op. Res. 11(3), 344–360 (1963)
5. Kramer, M., van Leeuwen, J.: The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. Adv. Comput. Res. 2, 129–146 (1984)