A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks
Data Structures and Algorithms
2018-07-12 v1
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.
Keywords
Cite
@article{arxiv.1807.04186,
title = {A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks},
author = {Assaf Kfoury},
journal= {arXiv preprint arXiv:1807.04186},
year = {2018}
}
Comments
14 pages, 2 figures, 18 references