2021/11/10 by Mourad Baı̈ou, Baiou, Mourad, Francisco Barahona +1
Computer Science · Social Sciences · #Advanced Computing and Algorithms #Advanced Graph Theory Research #Combinatorics (math.CO) #Digital Image Processing Techniques #FOS: Mathematics #Optimization and Control (math.OC)
paper · doi:10.48550/arxiv.2111.05699
openalex publication_date 2021/11/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.