Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Exploiting c-Closure in Kernelization Algorithms for Graph Problems | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12931/pdf/LIPIcs-ESA-2020-65.pdf/ / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3082339973 / rank | |||
Normal rank | |||
| Property / title | |||
Exploiting c-Closure in Kernelization Algorithms for Graph Problems (English) | |||
| Property / title: Exploiting c-Closure in Kernelization Algorithms for Graph Problems (English) / rank | |||
Normal rank | |||
Revision as of 11:05, 30 July 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
