A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks
Data Structures and Algorithms
2018-07-20 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1807.07067,
title = {A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks},
author = {Assaf Kfoury},
journal= {arXiv preprint arXiv:1807.07067},
year = {2018}
}
Comments
12 pages, 0 figures, 13 references. arXiv admin note: text overlap with arXiv:1807.04186