Journal of the ACM Bibliography
Donald B. Johnson. Parallel
algorithms for minimum cuts and maximum flows in planar networks.
Journal of the ACM, 34(4):950-967, October 1987.
[BibTeX entry]
Selected papers that cite this one
- Monika R. Henzinger, Philip Klein, Satish Rao, and Sairam Subramanian.
Faster
shortest-path algorithms for planar graphs. Journal of
Computer and System Sciences, 55(1):3-23, August 1997.
- Philip Klein, Satish Rao, Monika Rauch, and Sairam Subramanian. Faster shortest-path
algorithms for planar graphs. In Proceedings of the
Twenty-Sixth Annual ACM Symposium on the Theory of Computing,
pages 27-37, Montréal, Québec, Canada, 23-25 May 1994.
- Gary L. Miller and Joseph (Seffi) Naor. Flow in planar
graphs with multiple sources and sinks. SIAM Journal on
Computing, 24(5):1002-1017, October 1995.
Shortcuts: