An o(n³)-Time Algorithm Maximum-Flow Algorithm

Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn. An o(n³)-Time Algorithm Maximum-Flow Algorithm. SIAM Journal on Computing, 25(6):1144-1170, 1996.

@article{CheriyanHM96,
  title = {An o(n³)-Time Algorithm Maximum-Flow Algorithm},
  author = {Joseph Cheriyan and Torben Hagerup and Kurt Mehlhorn},
  year = {1996},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/CheriyanHM96},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {25},
  number = {6},
  pages = {1144-1170},
}