Advertisement

Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs

  • Petr HliněnýEmail author
  • Ondřej Slámečka
Conference paper
  • 358 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9548)

Abstract

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.

Keywords

Road Network Computation Path Canonical Generation Matroid Theory Simultaneous Disruption 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 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. 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. 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 MathSciNetCrossRefzbMATHGoogle Scholar
  4. 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
  5. 5.
    McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms 26(2), 306–324 (1998). http://dx.org/10.1006/jagm.1997.0898 MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Oxley, J.: Matroid Theory. Oxford graduate texts in mathematics. Oxford University Press, New York, USA (2006). http://books.google.cz/books?id=puKta1Hdz-8C zbMATHGoogle Scholar
  7. 7.
    Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12(4), 777–788 (1983). http://dx.org/10.1137/0212053 MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Reinelt, G., Wenger, K.M.: Generating partitions of a graph into a fixed number of minimum weight cuts. Discrete Optim. 7(1–2), 1–12 (2010). http://dx.org/10.1016/j.disopt.2009.07.001 MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Faculty of InformaticsMasaryk UniversityBrnoCzech Republic

Personalised recommendations