A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Hypergraphic matroids were studied first by Lorea [23] and later by Frank et al. [11]. They can be seen as generalizations of graphic matroids. Here we show that several algorithms developed for the graphic case can be extended to hypergraphic matroids. We treat the following: the separation problem for the associated polytope, testing independence, separation of partition inequalities, computing the rank of a set, computing the strength, computing the arboricity and network reinforcement.
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
T. Graham, A. Afzali, et al.
Microlithography 2000