An Improved Algorithm for the Half-Disjoint Paths Problem
From MaRDI portal
Publication:3225124
DOI10.1137/100808812zbMath1237.05202OpenAlexW1965636593MaRDI QIDQ3225124
Yusuke Kobayashi, Ken-ichi Kawarabayashi
Publication date: 15 March 2012
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100808812
Trees (05C05) Paths and cycles (05C38) Graph minors (05C83) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Graph Minors and Parameterized Algorithm Design ⋮ All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs ⋮ Combing a Linkage in an Annulus
This page was built for publication: An Improved Algorithm for the Half-Disjoint Paths Problem