How to make a digraph strongly connected

Abstract

Given a directed graphG, acovering is a subsetB of edges which meets all directed cuts ofG. Equivalently, the contraction of the elements ofB makesG strongly connected. AnO(n 5) primal-dual algorithm is presented for finding a minimum weight covering of an edge-weighted digraph. The algorithm also provides a constructive proof for a min-max theorem due to Lucchesi and Younger and for its weighted version.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    J. Edmonds andR. Giles, A min-max relation for submodular functions on graphs, in: “Studies in integer programming” (Proc. Workshop on Integer Programming Bonn, 1975; P. L. Hammer, E. L. Johnson, B. H. Korte, eds.),Annals of Discrete Math. 1 (1977) 185–204.

    MathSciNet  Article  Google Scholar 

  2. [2]

    L. R. Ford, Jr. andD. R. Fulkerson,Flows in Networks, Princeton Univ. Press, Princeton, N.J., 1962.

    MATH  Google Scholar 

  3. [3]

    A. Frank, An algorithm for submodular functions on graphs, submitted toAnnals of Discrete Math.

  4. [4]

    S. Fujishige, Algorithms for solving the independent flow problems,J. Operation Res. Soc. Japan, Vol.21, No. 2, June (1978).

  5. [5]

    A. V. Karzanov, On the minimal number of arcs of a digraph meeting all its directed cutsets, (abstract)Graph Theory Newsletters, Vol.8 (No. 4) March 1979.

  6. [6]

    E. L. Lawler,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.

    MATH  Google Scholar 

  7. [7]

    L. Lovász, On two minimax theorems in graph theory,J. Combinatorial Theory (B)21 (1976) 96–103.

    MATH  Article  Google Scholar 

  8. [8]

    C. L. Lucchesi andD. H. Younger, A minimax relation for directed graphs,J. London Math. Soc. (2)17 (1978) 369–374.

    MATH  Article  MathSciNet  Google Scholar 

  9. [9]

    C. L. Lucchesi,A minimax equality for directed graphs, Ph. D. Thesis, Univ. of Waterloo, Waterloo, Ont. 1976.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Frank, A. How to make a digraph strongly connected. Combinatorica 1, 145–153 (1981). https://doi.org/10.1007/BF02579270

Download citation

AMS (1980) subject classification

  • 05 C 20, 90 C 10, 05 C 40
  • 68 C 25, 68 E 10