Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157): Difference between revisions

@@ label / en / label / en @@
+Enumerating Minimal Transversals of Hypergraphs without Small Holes
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Q4406005
@@ Property / cites work: Q4406005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993087
@@ Property / cites work: Q3993087 / rank @@
+Normal rank
@@ Property / cites work @@
+Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
+Normal rank
@@ Property / cites work @@
+The negative cycles polyhedron and hardness of checking some polyhedral properties
+Normal rank
@@ Property / cites work @@
+Dual subimplicants of positive Boolean functions
@@ Property / cites work: Dual subimplicants of positive Boolean functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754179
@@ Property / cites work: Q2754179 / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
+Normal rank
@@ Property / cites work @@
+Decomposition of balanced matrices
@@ Property / cites work: Decomposition of balanced matrices / rank @@
+Normal rank
@@ Property / cites work @@
+New Results on Monotone Dualization and Generating Hypergraph Transversals
+Normal rank
@@ Property / cites work @@
+Identifying the Minimal Transversals of a Hypergraph and Related Problems
+Normal rank
@@ Property / cites work @@
+Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices
+Normal rank
@@ Property / cites work @@
+On the Complexity of Dualization of Monotone Disjunctive Normal Forms
+Normal rank
@@ Property / cites work @@
+Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
+Normal rank
@@ Property / cites work @@
+An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
+Normal rank
@@ Property / cites work @@
+On the Enumeration of Minimal Dominating Sets and Related Notions
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the Transversal Hypergraph Generation
+Normal rank
@@ Property / cites work @@
+Generating cut conjunctions in graphs and related problems
+Normal rank
@@ Property / cites work @@
+Generating all vertices of a polyhedron is hard
@@ Property / cites work: Generating all vertices of a polyhedron is hard / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
+Normal rank
@@ Property / cites work @@
+On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
+Normal rank
@@ Property / cites work @@
+Efficient enumeration of subgraphs and induced subgraphs with bounded girth
+Normal rank
@@ Property / cites work @@
+On the width-length inequality
@@ Property / cites work: On the width-length inequality / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
+Normal rank
@@ Property / cites work @@
+Q4221106
@@ Property / cites work: Q4221106 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://hal.archives-ouvertes.fr/hal-02083509
+Normal rank
@@ Property / OpenAlex ID @@
+W2889458773
@@ Property / OpenAlex ID: W2889458773 / rank @@
+Normal rank
@@ Property / title @@
+Enumerating Minimal Transversals of Hypergraphs without Small Holes (English)
+Normal rank