A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract)
From MaRDI portal
Publication:826071
DOI10.1007/3-540-63397-9_6zbMath1477.68207OpenAlexW2052412003MaRDI QIDQ826071
Ulrik Brandes, Dorothea Wagner
Publication date: 20 December 2021
Full work available at URL: https://doi.org/10.1007/3-540-63397-9_6
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
This page was built for publication: A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract)
