Abstract

Separator decompositions have proven to be useful for efficient parallel shortest-
path computation. In this paper the applicability of separator decompositions to
maximum ow computation is explored. It is shown that efficient parallel shortest-
path computation can be incorporated in the shortest augmenting path maximum
ow algorithm. A class of graphs is described for
... read more