An Efficient Algorithm for the Transversal Hypergraph Generation
From MaRDI portal
Recommendations
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
- Lower bounds for three algorithms for transversal hypergraph generation
- Computing and Combinatorics
Cited in
(31)- Combinatorial optimization in system configuration design
- Lower bounds for three algorithms for transversal hypergraph generation
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- Fast algorithms for implication bases and attribute exploration using proper premises
- Resolution based algorithms for the transversal hypergraph generation problem
- An average study of hypergraphs and their minimal transversals
- On the fixed-parameter tractability of the equivalence test of monotone normal forms
- Efficient algorithms for dualizing large-scale hypergraphs
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Faster Algorithms to Enumerate Hypergraph Transversals
- The minimal hitting set generation problem: algorithms and computation
- How to apply SAT-solving for the equivalence test of monotone normal forms
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
- Polynomial delay algorithm for listing minimal edge dominating sets in graphs
- A new approach to partial MUS enumeration
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
- Enumerating minimal transversals of hypergraphs without small holes
- On Tackling Explanation Redundancy in Decision Trees
- A Lower Bound for the HBC Transversal Hypergraph Generation
- A data mining formalization to improve hypergraph minimal transversal computation
- Using Transversals for Discovering XML Functional Dependencies
- Computing and Combinatorics
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
- Impartial hypergraph games
- An incremental algorithm for computing the transversal hypergraph
- On the average-case complexity of Berge algorithm
- Masking patterns in sequences: A new class of motif discovery with don't cares
- A note on systems with max-min and max-product constraints
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Node sampling for protein complex estimation in bait-prey graphs
- Computational aspects of monotone dualization: a brief survey
This page was built for publication: An Efficient Algorithm for the Transversal Hypergraph Generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3378517)
