L Auslander, E Feig, et al.
Advances in Applied Mathematics
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.
L Auslander, E Feig, et al.
Advances in Applied Mathematics
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Naga Ayachitula, Melissa Buco, et al.
SCC 2007
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991