Maximum Flow in Planar Networks
From MaRDI portal
Publication:3853414
DOI10.1137/0208012zbMath0419.90040MaRDI QIDQ3853414
Publication date: 1979
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b83835db99723f922b7b286d10952b08c68970a7
68Q25: Analysis of algorithms and problem complexity
90B10: Deterministic network models in operations research
Related Items
Bounding the variance in Monte Carlo experiments, Flow in planar graphs with vertex capacities, Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time, A linear-time algorithm for edge-disjoint paths in planar graphs, Unnamed Item