Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations

Siyue Liu, Olha Silina

Let $\vec{G}=(V,E^{+}\cup E^{-})$ be a bidirected graph whose underlying undirected graph $G=(V,E)$ is $2$-edge-connected. A strongly connected orientation (SCO) is defined as a subset…