A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks
classification
💻 cs.DS
keywords
algorithmfloweasyelementaryestablishedfixed-parametergluegraph-theoretical
read the original abstract
We pull together previously established graph-theoretical results to produce the algorithm in the paper's title. The glue are three easy elementary lemmas.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.