A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks
classification
💻 cs.DS
keywords
networksflowfixed-parameterlinear-timemethodplanarprincipaltypings
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.