A global parallel algorithm for the hypergraph transversal problem
From MaRDI portal
Recommendations
- Computing and Combinatorics
- 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
- Faster Algorithms to Enumerate Hypergraph Transversals
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
Cites work
- scientific article; zbMATH DE number 432767 (Why is no real title available?)
- scientific article; zbMATH DE number 4072403 (Why is no real title available?)
- scientific article; zbMATH DE number 49085 (Why is no real title available?)
- scientific article; zbMATH DE number 53984 (Why is no real title available?)
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 3545568 (Why is no real title available?)
- A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A fast parallel algorithm for the maximal independent set problem
- A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity
- An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
- Combinatorial characterization of read-once formulae
- Dual subimplicants of positive Boolean functions
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
- Dualization of regular Boolean functions
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
- Exact transversal hypergraphs and application to Boolean \(\mu\)-functions
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- LATIN 2004: Theoretical Informatics
- New results on monotone dualization and generating hypergraph transversals
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- The complexity of parallel search
Cited in
(18)- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Computing and Combinatorics
- The adjacency matrix of a graph as a data table: a geometric perspective
- Upper transversals in hypergraphs
- On the completability of incomplete Latin squares
- An average study of hypergraphs and their minimal transversals
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- Achieving new upper bounds for the hypergraph duality problem through logic
- Affine planes and transversals in 3-uniform linear hypergraphs
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- Minimal solutions of fuzzy relation equations via maximal independent elements
- A data mining formalization to improve hypergraph minimal transversal computation
- The minimal hitting set generation problem: algorithms and computation
- scientific article; zbMATH DE number 2230915 (Why is no real title available?)
- Scientific contributions of Leo Khachiyan (a short overview)
- Bounds on upper transversals in hypergraphs
This page was built for publication: A global parallel algorithm for the hypergraph transversal problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845919)
