Enumerating $k$-arc-connected orientations

Sarah Blind, Kolja Knauer, Petru Valicov

We study the problem of enumerating the $k$-arc-connected orientations of a graph $G$, i.e., generating each exactly once. A first algorithm using submodular flow optimization is e…