1. Bíl, M., Vodák, R., Hliněný, P., Svoboda, T., Rebok, T.: A novel method for rapid identification of road links causing network break-up, submitted to EJOR (2015)
2. Chhugani, J., Satish, N., Kim, C., Sewall, J., Dubey, P.: Fast and efficient graph traversal algorithm for CPUs: Maximizing single-node efficiency. In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium. IEEE, May 2012.
http://dx.org/10.1109/IPDPS.2012.43
3. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864–894 (1994).
http://dx.doi.org/10.1137/S0097539792225297
4. Dinic, E., Karzanov, A., Lomonosov, M.: A structure of the system of all minimum cuts of a graph. In: Fridman, A.A. (ed.) Studies in Discrete Optimization, Nauka, Moscow, pp. 290–306 (in Russian) (1976)
5. McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms 26(2), 306–324 (1998).
http://dx.org/10.1006/jagm.1997.0898