Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484)
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 7654492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of computing maximum minimal blocking and hitting sets |
scientific article; zbMATH DE number 7654492 |
Statements
Parameterized complexity of computing maximum minimal blocking and hitting sets (English)
0 references
16 February 2023
0 references
maximum minimal blocking set
0 references
maximum minimal hitting set
0 references
parameterized complexity
0 references
treewidth
0 references
kernelization
0 references
vertex cover
0 references
upper domination
0 references
0 references
0 references
0 references
0 references
0.729676365852356
0 references
0.7290511131286621
0 references
0.7247043251991272
0 references
0.7219619750976562
0 references
0.7179281711578369
0 references
