Planar graph vertex partition for linear problem kernels (Q355502)
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: Planar graph vertex partition for linear problem kernels |
scientific article; zbMATH DE number 6191045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graph vertex partition for linear problem kernels |
scientific article; zbMATH DE number 6191045 |
Statements
Planar graph vertex partition for linear problem kernels (English)
0 references
24 July 2013
0 references
parameterized algorithm
0 references
kernelization
0 references
connected vertex cover
0 references
edge dominating set
0 references
maximum triangle packing
0 references
0.9244544506072998
0 references
0.8654979467391968
0 references
0.8501154780387878
0 references
0.8351800441741943
0 references
0.8348874449729919
0 references
