A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7041820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs |
scientific article; zbMATH DE number 7041820 |
Statements
A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (English)
0 references
26 March 2019
0 references
geometric hypergraphs
0 references
minimal transversals
0 references
enumeration algorithms
0 references
minimal set covers
0 references
0 references
0 references
0 references
0 references
0 references
0.8824511170387268
0 references
0.8342050909996033
0 references
0.8092020153999329
0 references
0.7828508019447327
0 references
