Finding edge-disjoint paths in partial \(k\)-trees
From MaRDI portal
Publication:1969940
DOI10.1007/s004539910002zbMath0951.68100OpenAlexW2046202598MaRDI QIDQ1969940
Publication date: 12 December 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004539910002
Related Items
A tight relation between series-parallel graphs and bipartite distance hereditary graphs ⋮ The power of cut-based parameters for computing edge-disjoint paths ⋮ Max-multiflow/min-multicut for G+H series-parallel ⋮ The edge-disjoint paths problem is NP-complete for series-parallel graphs ⋮ On structural parameterizations of the edge disjoint paths problem ⋮ Walking through waypoints ⋮ Unnamed Item