A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps
From MaRDI portal
Publication:6326268
DOI10.1016/j.tcs.2021.10.023zbMath1532.68069arXiv1909.13848MaRDI QIDQ6326268
Publication date: 30 September 2019
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps
