BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-78-702
       ENTRY:: June 22, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: An O($n\cdot I \log^2 I$) maximum-flow algorithm
        TYPE:: Technical Report
      AUTHOR:: Shiloach, Yossi
        DATE:: December 1978
       PAGES:: 36
    ABSTRACT:: We present in this paper a new algorithm to find a maximum
               flow in a flow-network which has n vertices and m edges in
               time of O($n\cdot I \log^2 I$), where I = M+n is the input
               size (up to a constant factor). This result improves the
               previous upper bound of Z. Galil [1978] which was
               O($I^{7/3}$) in the worst case.
       NOTES:: [Adminitrivia V1/Prg/19950622]
         END:: STAN//CS-TR-78-702