Combinatorics for smaller kernels: the differential of a graph (Q476877)
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: Combinatorics for smaller kernels: the differential of a graph |
scientific article; zbMATH DE number 6375987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorics for smaller kernels: the differential of a graph |
scientific article; zbMATH DE number 6375987 |
Statements
Combinatorics for smaller kernels: the differential of a graph (English)
0 references
2 December 2014
0 references
parameterized algorithm
0 references
kernelization
0 references
approximation algorithm
0 references
combinatorial bounds
0 references
differential of a graph
0 references
0 references
0.8035403490066528
0 references
0.7841299772262573
0 references
0.774914562702179
0 references
0.7723085880279541
0 references
0.769301176071167
0 references
