A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks
Assaf Kfoury
TL;DR
This paper presents a fixed-parameter linear-time algorithm for computing maximum flow in planar networks, leveraging established graph-theoretical results and simple lemmas to improve efficiency.
Contribution
It introduces a novel fixed-parameter linear-time algorithm for maximum flow in planar networks, combining existing results with elementary lemmas.
Findings
Algorithm runs in linear time for fixed parameters.
Utilizes elementary lemmas to simplify complex graph-theoretical results.
Provides a unified approach to maximum flow in planar networks.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Mobile Ad Hoc Networks