# A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks

@article{Kfoury2018AFL, title={A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks}, author={A. Kfoury}, journal={ArXiv}, year={2018}, volume={abs/1807.04186} }

We pull together previously established graph-theoretical results to produce the algorithm in the paper's title. The glue are three easy elementary lemmas.

2 Citations

A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks

- Mathematics, Computer Science
- 2018

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 18 REFERENCES

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time

- Mathematics, Computer Science
- 2011

73

On the parallel computation of the biconnected and strongly connected co-components of graphs

- Computer Science
- 2007

1

Shortest path and maximum flow problems in networks with additive losses and gains

- Computer Science, Mathematics
- 2011

3