Enumerating Minimal Transversals of Hypergraphs without Small Holes
From MaRDI portal
Publication:5005157
DOI10.4230/LIPIcs.MFCS.2018.55OpenAlexW2889458773MaRDI QIDQ5005157
Mamadou Moustapha Kanté, Mozhgan Pourmoradnasseri, Kaveh Khoshkhah
Publication date: 4 August 2021
Full work available at URL: https://hal.archives-ouvertes.fr/hal-02083509
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- The negative cycles polyhedron and hardness of checking some polyhedral properties
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Generating cut conjunctions in graphs and related problems
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
- Decomposition of balanced matrices
- Efficient enumeration of subgraphs and induced subgraphs with bounded girth
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
- Reverse search for enumeration
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
- An Efficient Algorithm for the Transversal Hypergraph Generation
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- On the width-length inequality
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Dual subimplicants of positive Boolean functions
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices
- On the Enumeration of Minimal Dominating Sets and Related Notions
- Algorithm Theory - SWAT 2004
- Generating all vertices of a polyhedron is hard
This page was built for publication: Enumerating Minimal Transversals of Hypergraphs without Small Holes
