Identifying the Minimal Transversals of a Hypergraph and Related Problems
From MaRDI portal
Publication:4862797
Recommendations
Cited in
(only showing first 100 items - show all)- Self-duality of bounded monotone Boolean functions and related problems
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs
- A study on monotone self-dual Boolean functions
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Pareto-optimal patterns in logical analysis of data
- Generating dual-bounded hypergraphs
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Lower bounds for three algorithms for transversal hypergraph generation
- Minimum implicational basis for \(\wedge\)-semidistributive lattices
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
- Sequential testing of complex systems: a review
- Minimal dominating sets in interval graphs and trees
- Polynomial delay algorithm for listing minimal edge dominating sets in graphs
- On enumerating minimal dicuts and strongly connected subgraphs
- The parameterized complexity of maximality and minimality problems
- An approximation algorithm for submodular hitting set problem with linear penalties
- On the counting complexity of propositional circumscription
- Computational aspects of monotone dualization: a brief survey
- Generating cut conjunctions in graphs and related problems
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- Generating all maximal models of a Boolean expression
- Transversal hypergraphs and families of polyhedral cones
- Enumerating maximal consistent closed sets in closure systems
- Enumeration of minimal dominating sets and variants
- Symmetry geometry by pairings
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
- Bounds on upper transversals in hypergraphs
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Logical foundations of possibilistic keys
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Horn axiomatizations for sequential data
- Well-totally-dominated graphs
- The adjacency matrix of a graph as a data table: a geometric perspective
- Generating all vertices of a polyhedron is hard
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- An average study of hypergraphs and their minimal transversals
- Foundations of Information and Knowledge Systems
- On the complexity of enumerating pseudo-intents
- NP-completeness: a retrospective
- Combining probabilistic logic programming with the power of maximum entropy
- On Tackling Explanation Redundancy in Decision Trees
- Enumerating minimal dominating sets in chordal bipartite graphs
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Resolution based algorithms for the transversal hypergraph generation problem
- A global parallel algorithm for the hypergraph transversal problem
- Extended dualization: application to maximal pattern mining
- Counting and enumerating preferred database repairs
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- Complexity of DNF minimization and isomorphism testing for monotone formulas
- Algorithms for \(k\)-meet-semidistributive lattices
- Discovery of the \(D\)-basis in binary tables based on hypergraph dualization
- Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics
- On a cone covering problem
- On maximal chain subgraphs and covers of bipartite graphs
- scientific article; zbMATH DE number 1931696 (Why is no real title available?)
- Enumerating vertices of \(0/1\)-polyhedra associated with \(0/1\)-totally unimodular matrices
- Maximal sensitivity of Boolean nested canalizing functions
- Simple graphs in granular computing
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- A framework for incremental generation of closed itemsets
- Version spaces and the consistency problem
- Decompositions of positive self-dual Boolean functions
- Approximate inference of functional dependencies from relations
- Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
- Recognition and dualization of disguised bidual Horn functions.
- Zeon and idem-Clifford formulations of hypergraph problems
- Translation among CNFs, characteristic models and ordered binary decision diagrams
- Prediction-hardness of acyclic conjunctive queries
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- On the fixed-parameter tractability of the equivalence test of monotone normal forms
- An articulation point-based approximation algorithm for minimum vertex cover problem
- On quorum systems for group resources allocation
- Tree-shellability of Boolean functions
- A note on adding and deleting edges in hierarchical log-linear models
- Affine planes and transversals in 3-uniform linear hypergraphs
- Dependency structures for decision tables
- Simplicial complexes and closure systems induced by indistinguishability relations
- Generating minimal redundant and maximal irredundant subhypergraphs
- Minimal Roman dominating functions: extensions and enumeration
- Incremental complexity of a bi-objective hypergraph transversal problem
- Achieving new upper bounds for the hypergraph duality problem through logic
- Possibilistic keys
- New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
- Translating between the representations of a ranked convex geometry
- The complexity of dependency detection and discovery in relational databases
- On a logical approach to estimating computational complexity of potentially intractable problems.
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
- Embedding dimension of a good semigroup
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- scientific article; zbMATH DE number 179052 (Why is no real title available?)
- Minimal solutions of fuzzy relation equations via maximal independent elements
This page was built for publication: Identifying the Minimal Transversals of a Hypergraph and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862797)
