Conflict free version of covering problems on graphs: classical and parameterized (Q5918906)
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: Conflict free version of covering problems on graphs: classical and parameterized |
scientific article; zbMATH DE number 7240646
| 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 7240646 |
Statements
Conflict free version of covering problems on graphs: classical and parameterized (English)
0 references
26 August 2020
0 references
hereditary properties
0 references
parameterized algorithms
0 references
kernelization
0 references
vertex cover
0 references
conflict-freeness
0 references
0 references
0 references
0.9978055953979492
0 references
0.8606433272361755
0 references
0.8181714415550232
0 references
0.8102702498435974
0 references
0.7859543561935425
0 references
