A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks
arXiv:1807.04186
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.
14 pages, 2 figures, 18 references