A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:14, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(9k\) kernel for nonseparating independent set in planar graphs |
scientific article |
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
