  Hypergraphics matroids were studied first by Lorea and later by Frank et al.
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.
