On minimum flow and transitive reduction

  • Klaus Simon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 317)


In general, a flow problem G=(V,E,b,c) is given by a directed graph G=(V, E) and the two functions b and c on the set of edges, where b(e) means a lower and c(e) an upper bound. The aim is: Find a maximum (minimum) flow function f subject to the condition that
$$0 \leqslant b(e) \leqslant f(e) \leqslant c(e) \leqslant \infty \forall e \in E.$$
Here we search a minimum flow for the special case c(e)=∞. We show for this special case: There is a subgraph G'=(V, E') of G=(V, E) and a function b' on E' such that the flow problem G'=(V, E', b') is equivalent to G=(V,E,b). The subgraph G'=(V, E') is well-known as the transitive reduction of G. Since G' and b' are computable efficiently and in general |E'| is much smaller than |E|, we find a minimum flow f for an acyclic digraph G in average time O(n2·log2n). If G is strongly connected we need only worst case time O(n2).

Key words

Minimum flow transitive closure transitive reduction random digraph 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [1]
    A.V. Aho, M.R. Garey and J.D. Ullmany: The Transitive Reduction of a Directed Graph, SIAM J. Comput., Vol.1, No.2, 1972, 131–137.Google Scholar
  2. [2]
    P. Erdös, J. Spencer: Probabilistic Methods in Combinatorics, Academic Press, New York, 1974.Google Scholar
  3. [3]
    S. Even: Graph Algorithms, Computer Science Press, Potomac, MD, 1979.Google Scholar
  4. [4]
    L.R. Ford, Jr and D.R. Fulkerson: Flows in Networks, Princeton Univ. Press, Princeton, NJ, 1962.Google Scholar
  5. [5]
    H.N. Gabow: Scaling algorithms for network problems, Proc. 24th IEEE Symp. on Found. of Comput. Science (1983), 248–258.Google Scholar
  6. [6]
    A.V. Goldberg, R.E. Tarjan: A New Approach to the Maximum Flow Problem, Proc. 18th ACM Symp.on Theory of Computing (1986), 139–146.Google Scholar
  7. [7]
    A. Goralcikova, V. Koubek: A Reduct and Closure algorithm for Graphs, Mathematical Foundations of Computer Science 79, Springer Lecture Notes in Computer Science 74, 301–307.Google Scholar
  8. [8]
    K. Mehlhorn: Data Structures and Algorithms, Vol.2: Graph Algorithms and NP-Completeness, Springer, EATCS Monographs in Computer Science, 1984.Google Scholar
  9. [9]
    D.M. Moyles and G.L. Thompson: Finding a minimum equivalent graph of a digraph, J. Assoc. Comput. Mach. 16 (1969), 455–460.Google Scholar
  10. [10]
    V. Ramachandran: The Complexity of Minimum Cut and Maximum Flow Problems in an Acyclic Network., Tech.Rep. Coordinated Science Laboratory, 1101 W. Springfield Avenue, UrbanaGoogle Scholar
  11. [11]
    K. Simon: An Improved Algorithm for Transitive Closure on Acyclic Digraphs, Lecture Notes in Computer Science 226, Springer-Verlag, Proc 13th ICALP'86, pp.376–386.Google Scholar
  12. [12]
    D.D. Sleator: An O(n · m · log n) algorithm for maximum network flow, Tech. Rep. STANCS-80-831, Computer Science Dept, Stanford Univ, Stanford, CA, 1980.Google Scholar
  13. [13]
    D.D. Sleator and R.E. Tarjan: A data structure for dynamic trees, J. Comput. System Sci. 24 (1983), pp. 362–391.Google Scholar
  14. [14]
    D.D. Sleator and R.E. Tarjan: Selfadjusting binary search trees, J. Assoc. Comput. Mach. 32 (1985), 652–686.Google Scholar
  15. [15]
    R.E. Tarjan: Data Structures and Network Algorithms, Society for Industrial and Applied Math., Philadelphia, PA, 1983Google Scholar
  16. [16]
    R.E. Tarjan: Depth first search and linear graph algorithms, SICOMP 1 (1972), pp. 146–160.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Klaus Simon
    • 1
  1. 1.Fachbereich 10 Angewandte Mathematik und InformatikUniversität des SaarlandesSaarbrückenWest Germany

Personalised recommendations