Conflict free version of covering problems on graphs: classical and parameterized (Q5915577)
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 6986118
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conflict free version of covering problems on graphs: classical and parameterized |
scientific article; zbMATH DE number 6986118 |
Statements
Conflict free version of covering problems on graphs: classical and parameterized (English)
0 references
28 November 2018
0 references
hereditary properties
0 references
parameterized algorithms
0 references
kernelization
0 references
vertex cover
0 references
conflict-freeness
0 references
0.9978055953979492
0 references
0.8638067245483398
0 references
0.8212335109710693
0 references
0.8116030097007751
0 references
0.7883623838424683
0 references
