Corpus ID: 49664446

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}
}
  • A. Kfoury
  • Published 2018
  • Mathematics, Computer Science
  • ArXiv
  • We pull together previously established graph-theoretical results to produce the algorithm in the paper's title. The glue are three easy elementary lemmas. 

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks
    Efficient reassembling of three-regular planar graphs
    2

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES
    Disjoint paths in sparse graphs
    • C. Bentz
    • Computer Science, Mathematics
    • 2009
    3
    A Compositional Approach to Network Algorithms
    3
    Why Should Biconnected Components be Identified First
    8
    Efficient reassembling of three-regular planar graphs
    2
    Determining the Smallest k Such That G Is k -Outerplanar
    19
    Graph Theory
    4737
    Shortest path and maximum flow problems in networks with additive losses and gains
    3
    Efficient Reassembling of Graphs, Part 2: The Balanced Case
    3