On some algorithmic aspects of hypergraphic matroids - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics Year : 2023

On some algorithmic aspects of hypergraphic matroids

Abstract

Hypergraphics matroids were studied first by Lorea [18] and later by Frank et al [8]. 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.
Fichier principal
Vignette du fichier
hmatroid.pdf (296.33 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03872592 , version 1 (25-11-2022)

Identifiers

Cite

Mourad Baïou, Francisco Barahona. On some algorithmic aspects of hypergraphic matroids. Discrete Mathematics, 2023, 346 (2), pp.113222. ⟨10.1016/j.disc.2022.113222⟩. ⟨hal-03872592⟩
29 View
73 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More