Computing all $s$-$t$ bridges and articulation points simplified

Massimo Cairo, Shahbaz Khan, Romeo Rizzi +3

Given a directed graph $G$ and a pair of nodes $s$ and $t$, an $s$-$t$ bridge of $G$ is an edge whose removal breaks all $s$-$t$ paths of $G$. Similarly, an $s$-$t$ articulation po…