\((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226)
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: (k,n-k)-\textsc{Max-Cut}: an O^*(2p)-time algorithm and a polynomial kernel |
scientific article; zbMATH DE number 6958251
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel |
scientific article; zbMATH DE number 6958251 |
Statements
\((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (English)
0 references
18 October 2018
0 references
\textsc{Max-Cut}
0 references
parameterized algorithm
0 references
kernel
0 references
bounded search tree
0 references
0 references
0 references
0.9969100952148438
0 references
0.8219406008720398
0 references
0.8203589916229248
0 references
