A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
type: Item
instance of: scholarly article
title: A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
zbMATH Open document ID: 1417.68276
author: Imran Rauf
author: Saurabh Ray
author: Khaled Elbassioni
published in: Theoretical Computer Science
publication date: 2019-03-26T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 7041820
zbMATH Keywords: geometric hypergraphs
zbMATH Keywords: minimal transversals
zbMATH Keywords: enumeration algorithms
zbMATH Keywords: minimal set covers
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.09.027
OpenAlex ID: W2892384318
cites work: Q4071273
cites work: Complexity of identification and dualization of positive Boolean functions
cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems
cites work: New Results on Monotone Dualization and Generating Hypergraph Transversals
cites work: Foundations of Information and Knowledge Systems
cites work: NP-completeness: A retrospective
cites work: Q4268444
cites work: Design by example: An application of Armstrong relations
cites work: Q4004178
cites work: Q4736834
cites work: Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
cites work: Transversal hypergraphs and families of polyhedral cones
cites work: Enumerating Spanning and Connected Subsets in Graphs and Matroids
cites work: On generating all maximal independent sets
cites work: Q3622253
cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms
cites work: A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
cites work: On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
cites work: On the complexity of monotone dualization and generating minimal hypergraph transversals
cites work: Advances in Artificial Intelligence
cites work: LATIN 2004: Theoretical Informatics
cites work: Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
cites work: Exact transversal hypergraphs and application to Boolean \(\mu\)-functions
cites work: Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
cites work: A global parallel algorithm for the hypergraph transversal problem
cites work: Computational aspects of monotone dualization: a brief survey
cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
cites work: Efficient partition trees
cites work: Cutting hyperplanes for divide-and-conquer
cites work: Q4344150
cites work: Q4608035
cites work: The complexity of parallel search
cites work: Dual subimplicants of positive Boolean functions
DOI: 10.1016/J.TCS.2018.09.027
description: scientific article; zbMATH DE number 7041820