A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6237900
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(9k\) kernel for nonseparating independent set in planar graphs |
scientific article; zbMATH DE number 6237900 |
Statements
A \(9k\) kernel for nonseparating independent set in planar graphs (English)
0 references
13 December 2013
0 references
fixed parameter algorithms
0 references
kernelization
0 references
planar graphs
0 references
connected vertex cover
0 references
nonseparating independent set
0 references
0 references
0.96291321516037
0 references
0.820380687713623
0 references
0.8023515343666077
0 references
0.7719189524650574
0 references
0.76459801197052
0 references
