A linear time algorithm for the arc disjoint Menger problem in planar directed graphs

DOI10.1007/s004530010029zbMath0959.68097OpenAlexW2052100496MaRDI QIDQ1578388

Dorothea Wagner, Ulrik Brandes

Publication date: 27 August 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-72154

zbMATH Keywords

Menger problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Maximum flow in directed planar graphs with vertex capacities ⋮ Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths ⋮ Finding edge-disjoint paths in networks: an ant colony optimization algorithm

This page was built for publication: A linear time algorithm for the arc disjoint Menger problem in planar directed graphs