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)- Translation among CNFs, characteristic models and ordered binary decision diagrams
- 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
- Interior and exterior functions of positive Boolean functions.
- Simple graphs in granular computing
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Counting minimal transversals of -acyclic hypergraphs
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
- Recognition and dualization of disguised bidual Horn functions.
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- Sequential testing of complex systems: a review
- On the complexity of inducing categorical and quantitative association rules
- Pareto-optimal patterns in logical analysis of data
- Decompositions of positive self-dual Boolean functions
- Bidual Horn functions and extensions
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- Inner-core and outer-core functions of partially defined Boolean functions
- Pairings and related symmetry notions
- On the dualization in distributive lattices and related problems
- Translating between the representations of a ranked convex geometry
- Affine planes and transversals in 3-uniform linear hypergraphs
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- The complexity of dependency detection and discovery in relational databases
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
- Zeon and idem-Clifford formulations of hypergraph problems
- Enumerating maximal consistent closed sets in closure systems
- Counting and enumerating preferred database repairs
- A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
- Maximal sensitivity of Boolean nested canalizing functions
- Canonical dichotomous direct bases
- Bounds on upper transversals in hypergraphs
- Resolution based algorithms for the transversal hypergraph generation problem
- Possibilistic keys
- An average study of hypergraphs and their minimal transversals
- The adjacency matrix of a graph as a data table: a geometric perspective
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- On quorum systems for group resources allocation
- On the fixed-parameter tractability of the equivalence test of monotone normal forms
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- Simplicial complexes and closure systems induced by indistinguishability relations
- Dependency structures for decision tables
- The parameterized complexity of maximality and minimality problems
- On enumerating minimal dicuts and strongly connected subgraphs
- A framework for incremental generation of closed itemsets
- A note on adding and deleting edges in hierarchical log-linear models
- Prediction-hardness of acyclic conjunctive queries
- Extended dualization: application to maximal pattern mining
- Transversal hypergraphs and families of polyhedral cones
- On maximal chain subgraphs and covers of bipartite graphs
- A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs
- Logical foundations of possibilistic keys
- Generating all maximal models of a Boolean expression
- Incremental complexity of a bi-objective hypergraph transversal problem
- The minimal hitting set generation problem: algorithms and computation
- Enumeration of minimal dominating sets and variants
- Well-totally-dominated graphs
- Minimal dominating sets in interval graphs and trees
- Polynomial delay algorithm for listing minimal edge dominating sets in graphs
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
- Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints
- scientific article; zbMATH DE number 139917 (Why is no real title available?)
- scientific article; zbMATH DE number 179052 (Why is no real title available?)
- Generating dual-bounded hypergraphs
- Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
- NP-completeness: a retrospective
- Achieving new upper bounds for the hypergraph duality problem through logic
- scientific article; zbMATH DE number 1931696 (Why is no real title available?)
- A linear-time algorithm for the minimum degree hypergraph problem with the consecutive ones property
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Enumerating minimal transversals of hypergraphs without small holes
- Indiscernibility structures induced from function sets: graph and digraph case
- An articulation point-based approximation algorithm for minimum vertex cover problem
- On Tackling Explanation Redundancy in Decision Trees
- Discovery of the D-basis in binary tables based on hypergraph dualization
- Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics
- Algorithms for k-meet-semidistributive lattices
- Embedding dimension of a good semigroup
- Enumerating vertices of 0/1-polyhedra associated with 0/1-totally unimodular matrices
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- A study on monotone self-dual Boolean functions
- Decision systems in rough set theory: a set operatorial perspective
- Symmetry geometry by pairings
- Granular computing on basic digraphs
- On a logical approach to estimating computational complexity of potentially intractable problems.
- Foundations of Information and Knowledge Systems
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- Generating all vertices of a polyhedron is hard
- Tree-shellability of Boolean functions
- Minimal Roman dominating functions: extensions and enumeration
- Controlling entity integrity with key sets
- Mining ℰℒ⊥ Bases with Adaptable Role Depth
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- On a cone covering problem
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)
