The following pages link to (Q4708957):
Displaying 33 items.
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- A study on monotone self-dual Boolean functions (Q523743) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- Minimum implicational basis for \(\wedge\)-semidistributive lattices (Q845722) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Self-duality of bounded monotone Boolean functions and related problems (Q944707) (← links)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
- Blocker size via matching minors (Q1637141) (← links)
- Simple graphs in granular computing (Q1671713) (← links)
- Logic-based argumentation with existential rules (Q1678415) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
- Zeon and idem-Clifford formulations of hypergraph problems (Q2095249) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- An average study of hypergraphs and their minimal transversals (Q2355712) (← links)
- The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
- On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
- Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741) (← links)
- Some Complexity Results about Essential Closed Sets (Q3003410) (← 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)
- Join on Closure Systems Using Direct Implicational Basis Representation (Q3627735) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- Exact and Approximate Minimal Pattern Mining (Q5016645) (← links)
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
- Towards the Use of Hypergraphs in Multi-adjoint Logic Programming (Q5215753) (← links)
- Immune sets in monotone infection rules. Characterization and complexity (Q6064851) (← links)
- Persistent hyperdigraph homology and persistent hyperdigraph Laplacians (Q6154221) (← links)
- Minimal solutions of fuzzy relation equations via maximal independent elements (Q6645051) (← links)
