Corpus ID: 49880181

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}
}
  • A. Kfoury
  • Published 2018
  • Mathematics, Computer Science
  • ArXiv
  • 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
    2
    Determining the Smallest k Such That G Is k -Outerplanar
    19
    Disjoint paths in sparse graphs
    • C. Bentz
    • Computer Science, Mathematics
    • 2009
    3
    Efficient reassembling of three-regular planar graphs
    2
    Efficient reassembling of graphs, part 1: the linear case
    6
    Shortest path and maximum flow problems in networks with additive losses and gains
    3
    Planarity Testing and Embedding
    29
    Efficient Reassembling of Graphs, Part 2: The Balanced Case
    3
    Safe Compositional Equation-based Modeling of Constrained Flow Networks
    17