Skip to main content
SpringerLink
Log in

Packing rooted directed cuts in a weighted directed graph

  • Published:
Mathematical Programming Submit manuscript

Abstract

A simple algorithm is described for constructing a maximum packing of cuts directed away from a distinguished vertex, called the root, in a directed graph, each of whose edges has a nonnegative weight, and it is shown that the maximum packing value is equal to the weight of a minimum-weight spanning arborescence directed away from the root.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.J. Duffin, “The extremal length of a network”,Journal of Mathematical Analysis and Applications 5 (1962) 200.

    Google Scholar 

  2. J. Edmonds, “Optimum branchings”, in:Mathematics of the decision sciences Eds. G.B. Dantzig and A.F. Veinott, Jr., Lectures in Applied Mathematics, Vol. 11 (American Mathematical Society, Providence, R.I., 1968) p. 346.

    Google Scholar 

  3. J. Edmonds, “Submodular functions, matroids, and certain polyhedra”, in:Combinatorial structures and their applications Eds. R. Guy, H. Hanani, N. Sauer and J. Schonheim (Gordon and Breach, New York, 1970) p. 69.

    Google Scholar 

  4. J. Edmonds, “Edge-disjoint branchings”, to appear.

  5. L.R. Ford, Jr. and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeto, N.J., 1962).

    Google Scholar 

  6. D.R. Fulkerson, “Blocking polyhedra”, in:Graph theory and its applications Ed. B. Harris (Academic Press, New York, 1970) p. 93.

    Google Scholar 

  7. D.R. Fulkerson, “Anti-blocking polyhedra”,Journal of Combinatorial Theory 12 (1972) 50.

    Google Scholar 

  8. D.R. Fulkerson, “Blocking and anti-blocking pairs of polyhedra”,Mathematical Programming 1 (1971) 168.

    Google Scholar 

  9. A. Lehman, “On the width—length inequality”, mimeograph (1965).

Download references

Author information

Authors and Affiliations

  1. Cornell University, Ithaca, New York, USA

    D. R. Fulkerson

Authors
  1. D. R. Fulkerson
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the National Science Foundation under grant GP-32316X and partially by the Office of Naval Research under grant N00014-67-A-0077-0028.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fulkerson, D.R. Packing rooted directed cuts in a weighted directed graph. Mathematical Programming 6, 1–13 (1974). https://doi.org/10.1007/BF01580218

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01580218

Keywords

Search

Navigation