Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
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.
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics