All Multiway Cuts

During 2014 and 2015 I implemented and evaluated the Circuit-Cocircuit algorithm. This algorithm was proposed by prof. Petr Hliněný to solve the problem of generating all minimal multiway edge cuts of a graph. Besides rather neat theory around it (it's based on ideas from matroid theory) it also has a practical use, for example The Transport Research Centre uses this algorithm for infrastructure planning research.

This research was the topic of my bachelor's thesis and it resulted in a paper published in LNCS proceedings of MEMICS 2015. The algorithm implementation with documentation is available at GitHub.