Constant congestion linkages in polynomially strong digraphs in polynomial time

Raul Lopes, Ignasi Sau

Given integers $k,c>0$, we say that a digraph $D$ is $(k,c)$-linked if for every pair of ordered sets $\{s_1,\dots ,s_k\}$ and $\{t_1,\dots ,t_k\}$ of vertices of $D$, there…