Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs
- 358 Downloads
We propose a new algorithm for practically feasible exhaustive generation of small multiway cuts in sparse graphs. The purpose of the algorithm is to support a complete analysis of critical combinations of road disruptions in real-world road networks. Our algorithm elaborates on a simple underlying idea from matroid theory – that a circuit-cocircuit intersection cannot have cardinality one (here cocircuits are the generated cuts). We evaluate the practical performance of the algorithm on real-world road networks, and propose algorithmic improvements based on the technique of generation by a canonical construction path.
KeywordsRoad Network Computation Path Canonical Generation Matroid Theory Simultaneous Disruption
- 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)Google Scholar
- 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
- 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)Google Scholar