1. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiway cuts (extended abstract). In: Proceedings of 24th ACM Symposium on Theory of Computing (STOC’92), pp. 241–251 (1992)
2. Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification—a technique for speeding up dynamic graph algorithms. J. ACM 44, 669–696 (1997)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
4. Goldschmidt, O., Hochbaum, D.S.: Polynomial algorithm for the k-cut problem. In: Proceedings of 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS’88), pp. 444–451 (1988)
5. Gu, W., Jia, X.: On a traffic control problem. In: Proceedings of 8th International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN’05), pp. 510–515 (2005)