A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks

Maxim Babenko, Ignat Kolesnichenko, Ilya Razenshteyn

Consider an undirected graph $G=(VG,EG)$ and a set of six \emph{terminals} $T=\{s_1,s_2,s_3,t_1,t_2,t_3\}\subseteq VG$. The goal is to find a collection $\calP$ of thr…