Pages that link to "Item:Q4706216"
From MaRDI portal
The following pages link to New Results on Monotone Dualization and Generating Hypergraph Transversals (Q4706216):
Displaying 47 items.
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Algorithms for \(k\)-meet-semidistributive lattices (Q507534) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Version spaces and the consistency problem (Q814597) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
- Blocker size via matching minors (Q1637141) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\). (Q1853168) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- On the dualization in distributive lattices and related problems (Q2030249) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Fast algorithms for implication bases and attribute exploration using proper premises (Q2248531) (← links)
- Incremental delay enumeration: space and time (Q2274091) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- Asymptotically optimal dualization algorithms (Q2354515) (← links)
- An average study of hypergraphs and their minimal transversals (Q2355712) (← links)
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (Q2373724) (← links)
- On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
- The many benefits of putting stack filters into disjunctive or conjunctive normal form (Q2387438) (← links)
- Extended dualization: application to maximal pattern mining (Q2634673) (← links)
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) (← links)
- The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
- How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms (Q3007677) (← links)
- Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (Q3449842) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
- (Q5090998) (← links)
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
- (Q5150622) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- Dualization in lattices given by implicational bases (Q5919405) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)
- Minimal solutions of fuzzy relation equations via maximal independent elements (Q6645051) (← links)
- New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems (Q6657241) (← links)
