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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
R.J. Duffin, “The extremal length of a network”,Journal of Mathematical Analysis and Applications 5 (1962) 200.
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.
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.
J. Edmonds, “Edge-disjoint branchings”, to appear.
L.R. Ford, Jr. and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeto, N.J., 1962).
D.R. Fulkerson, “Blocking polyhedra”, in:Graph theory and its applications Ed. B. Harris (Academic Press, New York, 1970) p. 93.
D.R. Fulkerson, “Anti-blocking polyhedra”,Journal of Combinatorial Theory 12 (1972) 50.
D.R. Fulkerson, “Blocking and anti-blocking pairs of polyhedra”,Mathematical Programming 1 (1971) 168.
A. Lehman, “On the width—length inequality”, mimeograph (1965).
Author information
Authors and Affiliations
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
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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01580218