John S. Lew
Mathematical Biosciences
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.
John S. Lew
Mathematical Biosciences
Matthew A Grayson
Journal of Complexity
Jianke Yang, Robin Walters, et al.
ICML 2023
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994