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)- scientific article; zbMATH DE number 1931696 (Why is no real title available?)
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Minimal solutions of fuzzy relation equations via maximal independent elements
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
- Counting minimal transversals of -acyclic hypergraphs
- Canonical dichotomous direct bases
- The minimal hitting set generation problem: algorithms and computation
- A note on adding and deleting edges in hierarchical log-linear models
- Controlling entity integrity with key sets
- New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
- Counting and enumerating preferred database repairs
- Enumeration of minimal dominating sets and variants
- Inner-core and outer-core functions of partially defined Boolean functions
- Well-totally-dominated graphs
- Enumerating minimal transversals of hypergraphs without small holes
- Pareto-optimal patterns in logical analysis of data
- Combining probabilistic logic programming with the power of maximum entropy
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- 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
- Complexity of DNF minimization and isomorphism testing for monotone formulas
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
- On the complexity of enumerating pseudo-intents
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
- Minimal Roman dominating functions: extensions and enumeration
- Version spaces and the consistency problem
- Computing the D-base and D-relation in finite closure systems
- Simple graphs in granular computing
- Minimum implicational basis for \(\wedge\)-semidistributive lattices
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
- Bounds on upper transversals in hypergraphs
- Enumerating minimal solution sets for metric graph problems
- Zeon and idem-Clifford formulations of hypergraph problems
- On maximal chain subgraphs and covers of bipartite graphs
- Polynomial delay algorithm for listing minimal edge dominating sets in graphs
- Enumerating minimal solution sets for metric graph problems
- Recognition and dualization of disguised bidual Horn functions.
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- Indiscernibility structures induced from function sets: graph and digraph case
- An approximation algorithm for submodular hitting set problem with linear penalties
- Possibilistic keys
- Foundations of Information and Knowledge Systems
- Conformal hypergraphs: duality and implications for the upper clique transversal problem
- Mining ℰℒ⊥ Bases with Adaptable Role Depth
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- An articulation point-based approximation algorithm for minimum vertex cover problem
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Lower bounds for three algorithms for transversal hypergraph generation
- Enumerating minimal connected dominating sets
- The adjacency matrix of a graph as a data table: a geometric perspective
- Generating all maximal models of a Boolean expression
- On a logical approach to estimating computational complexity of potentially intractable problems.
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
- Prediction-hardness of acyclic conjunctive queries
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- Incremental complexity of a bi-objective hypergraph transversal problem
- Approximate inference of functional dependencies from relations
- Interior and exterior functions of positive Boolean functions.
- Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints
- Bidual Horn functions and extensions
- Decision systems in rough set theory: a set operatorial perspective
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- A study on monotone self-dual Boolean functions
- Enumerating minimal connected dominating sets
- The complexity of dependency detection and discovery in relational databases
- On enumerating minimal dicuts and strongly connected subgraphs
- The parameterized complexity of maximality and minimality problems
- Enumerating vertices of 0/1-polyhedra associated with 0/1-totally unimodular matrices
- A global parallel algorithm for the hypergraph transversal problem
- Embedding dimension of a good semigroup
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- An average study of hypergraphs and their minimal transversals
- On the complexity of inducing categorical and quantitative association rules
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Generating all vertices of a polyhedron is hard
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Self-duality of bounded monotone Boolean functions and related problems
- Minimal Roman dominating functions: extensions and enumeration
- A linear-time algorithm for the minimum degree hypergraph problem with the consecutive ones property
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Tree-shellability of Boolean functions
- A framework for incremental generation of closed itemsets
- A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
- Enumerating minimal dominating sets in chordal bipartite graphs
- Extended dualization: application to maximal pattern mining
- On the counting complexity of propositional circumscription
- Sequential testing of complex systems: a review
- Horn axiomatizations for sequential data
- Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
- Hypergraph dualization with \textsf{FPT}-delay parameterized by the degeneracy and dimension
- Translation among CNFs, characteristic models and ordered binary decision diagrams
- Maximal sensitivity of Boolean nested canalizing functions
- On Tackling Explanation Redundancy in Decision Trees
- On the dualization in distributive lattices and related problems
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)
