About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
On the submodular matrix representation of a digraph
Abstract
We reexamine the class of (0, ±1) matrices called submodular, which we introduced in (Ann. Discrete Math. 15 (1982) 189). Our key idea in this paper is to define, for each submodular matrix M, a corresponding digraph G whose nodes are the columns of M. Our principal results are as follows: (a) a graph-theoretic interpretation of the polyhedron P(M) = {x: x ≥ 0, Mx ≥ -1}, and (b) for a given G, the description of a submodular matrix contained in all submodular matrices representing G. © 2002 Elsevier Science B.V. All rights reserved.