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

@article{Kfoury2018AFL, title={A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks}, author={A. Kfoury}, journal={ArXiv}, year={2018}, volume={abs/1807.07067} }

We present an alternative and simpler method for computing principal typings of flow networks. When limited to planar flow networks, the method can be made to run in fixed-parameter linear-time -- where the parameter not to be exceeded is what is called the edge-outerplanarity of the networks' underlying graphs.

#### Topics from this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 13 REFERENCES

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

- Mathematics, Computer Science
- 2018

2

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

- Computer Science, Mathematics
- 2011

3