scientific article; zbMATH DE number 1931696
From MaRDI portal
Publication:4708957
Recommendations
- Foundations of Information and Knowledge Systems
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Computing and Combinatorics
- scientific article; zbMATH DE number 1670855
Cited in
(40)- On the fractional chromatic number of monotone self-dual Boolean functions
- Combinatorial optimization in system configuration design
- Lower bounds for three algorithms for transversal hypergraph generation
- Blocker size via matching minors
- Simple graphs in granular computing
- Logic-based argumentation with existential rules
- Counting minimal transversals of -acyclic hypergraphs
- Zeon and idem-Clifford formulations of hypergraph problems
- Resolution based algorithms for the transversal hypergraph generation problem
- An average study of hypergraphs and their minimal transversals
- The adjacency matrix of a graph as a data table: a geometric perspective
- On the fixed-parameter tractability of the equivalence test of monotone normal forms
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Some complexity results about essential closed sets
- How to apply SAT-solving for the equivalence test of monotone normal forms
- Enumeration of minimal dominating sets and variants
- Join on Closure Systems Using Direct Implicational Basis Representation
- Achieving new upper bounds for the hypergraph duality problem through logic
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Exact and approximate minimal pattern mining
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs
- Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
- A study on monotone self-dual Boolean functions
- On a logical approach to estimating computational complexity of potentially intractable problems.
- Foundations of Information and Knowledge Systems
- Immune sets in monotone infection rules. Characterization and complexity
- Persistent hyperdigraph homology and persistent hyperdigraph Laplacians
- On the complexity of enumerating pseudo-intents
- Minimal solutions of fuzzy relation equations via maximal independent elements
- On the average-case complexity of Berge algorithm
- Covering-based numbers related to the LS-category of finite spaces
- Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
- Monomial polarization and depolarization of abstract simplicial complexes
- Enumeration of minimal hitting sets parameterized by treewidth
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Minimum implicational basis for \(\wedge\)-semidistributive lattices
- Enumerating minimal dominating sets in chordal bipartite graphs
- Computational aspects of monotone dualization: a brief survey
- Self-duality of bounded monotone Boolean functions and related problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708957)
