Lower bounds for three algorithms for transversal hypergraph generation
From MaRDI portal
Recommendations
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
- A Lower Bound for the HBC Transversal Hypergraph Generation
- An Efficient Algorithm for the Transversal Hypergraph Generation
- Computing and Combinatorics
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
Cites work
- A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph
- An Efficient Algorithm for the Transversal Hypergraph Generation
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
- Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
- How to assign votes in a distributed system
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 1961543 (Why is no real title available?)
- scientific article; zbMATH DE number 1931696 (Why is no real title available?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- NP-completeness: a retrospective
- On Berge Multiplication for Monotone Boolean Dualization
- On enumerating minimal dicuts and strongly connected subgraphs
- On generating all maximal independent sets
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the complexity of inferring functional dependencies
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
- On the frequency of the most frequently occurring variable in dual monotone DNFs
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Using Transversals for Discovering XML Functional Dependencies
Cited in
(18)- The adjacency matrix of a graph as a data table: a geometric perspective
- Simplicial complexes and closure systems induced by indistinguishability relations
- Efficient algorithms for dualizing large-scale hypergraphs
- The minimal hitting set generation problem: algorithms and computation
- Enumerating all solutions of a Boolean CSP by non-decreasing weight
- An Efficient Algorithm for the Transversal Hypergraph Generation
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
- A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph
- Indiscernibility structures induced from function sets: graph and digraph case
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds
- Local dissymmetry on graphs and related algebraic structures
- Transformation and decomposition of clutters into matroids
- Decision systems in rough set theory: a set operatorial perspective
- A Lower Bound for the HBC Transversal Hypergraph Generation
- Computing and Combinatorics
- Granular computing on basic digraphs
- On the average-case complexity of Berge algorithm
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
This page was built for publication: Lower bounds for three algorithms for transversal hypergraph generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028117)
