On the Submodular Matrix Representation of a Digraph

We reexamine the class of (0,+-1) matrices called submodular,
which we introduced in [2]. 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: (a) a graph-theoretic interpretation of the polyhedron
P(M) = {x : x >= 0,M >= -l},and (b) for a given G, the description of a submodular
matrix contained in all submodular matrices representing G.

By: Arlette Gaillard, Heinz Groeflin, Alan J. Hoffman, William R. Pulleyblank

Published in: Theoretical Computer Science, volume 287, (no 2), pages 563-70 in 2002

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to reports@us.ibm.com .