BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-78-653
       ENTRY:: June 22, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Multi-terminal 0-1 flow
        TYPE:: Technical Report
      AUTHOR:: Shiloach, Yossi
        DATE:: April 1978
       PAGES:: 20
    ABSTRACT:: Given an undirected 0-1 flow network with n vertices and m
               edges, we present an O($n^2$(m+n)) algorithm which generates
               all ($n\choose 2$) maximal flows between all the pairs of
               vertices. Since O($n^2$(m+n)) is also the size of the output,
               this algorithm is optimal up to a constant factor.
       NOTES:: [Adminitrivia V1/Prg/19950622]
         END:: STAN//CS-TR-78-653