Parallel algorithms for minimum cuts and maximum flows in planar networks

  • Donald B. Johnson
  • Published 1982 in
    23rd Annual Symposium on Foundations of Computer…

Abstract

Algorithms are given that compute maximum flows in planar directed networks either in <italic>O</italic>((log <italic>n</italic>)<supscrpt>3</supscrpt>) parallel time using <italic>O</italic>(<italic>n</italic><supscrpt>4</supscrpt>) processors or <italic>O</italic>((log <italic>n</italic>)<supscrpt>2</supscrpt>) parallel time using <italic>O</italic… (More)
DOI: 10.1145/31846.31849

Topics

3 Figures and Tables

Cite this paper

@article{Johnson1982ParallelAF, title={Parallel algorithms for minimum cuts and maximum flows in planar networks}, author={Donald B. Johnson}, journal={23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)}, year={1982}, pages={244-254} }