Pages that link to "Item:Q3378517"
From MaRDI portal
The following pages link to An Efficient Algorithm for the Transversal Hypergraph Generation (Q3378517):
Displaying 28 items.
- Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) (← links)
- A note on systems with max-min and max-product constraints (Q835215) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- Node sampling for protein complex estimation in bait-prey graphs (Q906241) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- Fast algorithms for implication bases and attribute exploration using proper premises (Q2248531) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- An average study of hypergraphs and their minimal transversals (Q2355712) (← links)
- On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
- Efficient algorithms for dualizing large-scale hypergraphs (Q2449091) (← links)
- Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741) (← links)
- Faster Algorithms to Enumerate Hypergraph Transversals (Q2802949) (← links)
- The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
- How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms (Q3007677) (← links)
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712) (← links)
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (Q3449842) (← links)
- A New Approach to Partial MUS Enumeration (Q3453242) (← links)
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation (Q3508578) (← links)
- Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
- On Tackling Explanation Redundancy in Decision Trees (Q5041018) (← links)
- A Lower Bound for the HBC Transversal Hypergraph Generation (Q5416742) (← links)
- Using Transversals for Discovering XML Functional Dependencies (Q5445302) (← links)
- Computing and Combinatorics (Q5716999) (← links)
- Algorithms - ESA 2003 (Q5897277) (← links)
- Impartial hypergraph games (Q6046219) (← links)
