Enumerating minimal transversals of hypergraphs without small holes
From MaRDI portal
Recommendations
- Enumerating minimal dominating sets in chordal bipartite graphs
- Faster Algorithms to Enumerate Hypergraph Transversals
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
Cites work
- Algorithm Theory - SWAT 2004
- An Efficient Algorithm for the Transversal Hypergraph Generation
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Decomposition of balanced matrices
- Dual subimplicants of positive Boolean functions
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
- Efficient enumeration of subgraphs and induced subgraphs with bounded girth
- Enumerating vertices of 0/1-polyhedra associated with 0/1-totally unimodular matrices
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Generating all vertices of a polyhedron is hard
- Generating cut conjunctions in graphs and related problems
- scientific article; zbMATH DE number 1670855 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1934542 (Why is no real title available?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- On the enumeration of minimal dominating sets and related notions
- On the width-length inequality
- Reverse search for enumeration
- The negative cycles polyhedron and hardness of checking some polyhedral properties
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
Cited in
(5)- Counting minimal transversals of -acyclic hypergraphs
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
- Enumerating minimal solution sets for metric graph problems
- Enumerating minimal solution sets for metric graph problems
This page was built for publication: Enumerating minimal transversals of hypergraphs without small holes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005157)
