On dijoins

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

For every nonnegative integer arc weight function w, the minimum weight of a dicut is at least as large as the maximum number of dijoins such that no arc a is contained in more than iv(o) of these dijoins. We give two examples of digraphs with strict inequality for some weight w and discuss the possibility that, together with an example due to Schrijver, these are the only "minimal" such examples. © 2002 Elsevier Science B.V.

Cite

CITATION STYLE

APA

Cornuéjols, G., & Guenin, B. (2002). On dijoins. Discrete Mathematics, 243(1–3), 213–216. https://doi.org/10.1016/S0012-365X(01)00209-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free