A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
From MaRDI portal
Publication:1733046
Recommendations
- Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
- A global parallel algorithm for the hypergraph transversal problem
- Computing and Combinatorics
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
Cites work
- A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
- A global parallel algorithm for the hypergraph transversal problem
- Advances in Artificial Intelligence
- Complexity of identification and dualization of positive Boolean functions
- Computational aspects of monotone dualization: a brief survey
- Cutting hyperplanes for divide-and-conquer
- Derandomized concentration bounds for polynomials, and hypergraph maximal independent set
- Design by example: An application of Armstrong relations
- Dual subimplicants of positive Boolean functions
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
- Efficient partition trees
- Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
- Enumerating Spanning and Connected Subsets in Graphs and Matroids
- Exact transversal hypergraphs and application to Boolean \(\mu\)-functions
- Foundations of Information and Knowledge Systems
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- scientific article; zbMATH DE number 5548206 (Why is no real title available?)
- scientific article; zbMATH DE number 53984 (Why is no real title available?)
- scientific article; zbMATH DE number 3487492 (Why is no real title available?)
- scientific article; zbMATH DE number 1354130 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 2086380 (Why is no real title available?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- LATIN 2004: Theoretical Informatics
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- NP-completeness: a retrospective
- On generating all maximal independent sets
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
- Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
- The complexity of parallel search
- Transversal hypergraphs and families of polyhedral cones
Cited in
(9)- Faster Algorithms to Enumerate Hypergraph Transversals
- Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- Enumerating minimal solution sets for metric graph problems
- Enumerating minimal solution sets for metric graph problems
- Enumerating minimal dominating sets and variants in chordal bipartite graphs
- Enumerating spanners in directed temporal graphs
- An approximation algorithm for submodular hitting set problem with linear penalties
- A global parallel algorithm for the hypergraph transversal problem
This page was built for publication: A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733046)
