Can a maximum flow be computed in $o(nm)$ time?. Cheriyan, J., Hagerup, T., & Mehlhorn, K. In Proc. of International Colloquium on Automata, Languages and Programming (ICALP 1990), of Lect Notes Comput Sci, pages 235–248, 1990.
bibtex   
@InProceedings{cheriyan90can,
  author    = {Cheriyan, Joseph and Hagerup, Torben and Mehlhorn, Kurt},
  title     = {Can a maximum flow be computed in $o(nm)$ time?},
  booktitle = {Proc. of International Colloquium on Automata, Languages and Programming (ICALP 1990)},
  year      = {1990},
  number    = {443},
  series    = lncs,
  pages     = {235--248},
  publisher = Springer,
  comment   = {randomisierte Version, siehe King et al fuer die de-randomisierung},
  isbn      = {0-387-52826-1},
  location  = {Warwick University, England},
  owner     = {Sebastian},
  timestamp = {2010.07.12},
}

Downloads: 0