Identifying the Minimal Transversals of a Hypergraph and Related Problems (Q4862797)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Identifying the Minimal Transversals of a Hypergraph and Related Problems |
scientific article; zbMATH DE number 840257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identifying the Minimal Transversals of a Hypergraph and Related Problems |
scientific article; zbMATH DE number 840257 |
Statements
Identifying the Minimal Transversals of a Hypergraph and Related Problems (English)
0 references
28 July 1996
0 references
hitting sets
0 references
algorithmic complexity
0 references
hypergraph
0 references
transversal hypergraph
0 references
hypergraph saturation problem
0 references
self-complemented hypergraphs
0 references
color
0 references
polynomial time algorithms
0 references
acyclic hypergraphs
0 references
databases
0 references
Boolean switching
0 references
0.8478441834449768
0 references
0.8365815877914429
0 references
0.8184152841567993
0 references
