Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.ESA.2020.65 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.ESA.2020.65 / rank | |||
Normal rank | |||
Latest revision as of 18:44, 30 December 2024
scientific article; zbMATH DE number 7651204
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting c-Closure in Kernelization Algorithms for Graph Problems |
scientific article; zbMATH DE number 7651204 |
Statements
7 February 2023
0 references
fixed-parameter tractability
0 references
kernelization
0 references
\(c\)-closure
0 references
dominating set
0 references
induced matching
0 references
irredundant set
0 references
Ramsey numbers
0 references
Exploiting c-Closure in Kernelization Algorithms for Graph Problems (English)
0 references
0 references
0 references
0 references
0 references
0 references
