The Lattice Structure of Flow in Planar Graphs

@article{Khuller1993TheLS,
  title={The Lattice Structure of Flow in Planar Graphs},
  author={Samir Khuller and Joseph Naor and Philip N. Klein},
  journal={SIAM J. Discrete Math.},
  year={1993},
  volume={6},
  pages={477-490}
}
Flow in planar graphs has been extensively studied, and very efficient algorithms have been developed to compute max-flows, min-cuts, and circulations. Intimate connections between solutions to the planar circulation problem and with "consistent" potential functions in the dual graph are shown. It is also shown that the set of integral circulations in a planar graph very naturally forms a distributive lattice whose maximum corresponds to the shortest path tree in the dual graph. Further… CONTINUE READING

References

Publications referenced by this paper.

QUEYRANNE , On the structure ofall minimum cuts in a network and its applications , Math

M. J.PICARDAND
-1

Similar Papers

Loading similar papers…