A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354)
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: A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs |
scientific article; zbMATH DE number 7357821
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs |
scientific article; zbMATH DE number 7357821 |
Statements
A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (English)
0 references
11 June 2021
0 references
bisection
0 references
semicomplete digraph
0 references
tournament
0 references
FPT algorithm
0 references
chromatic coding
0 references
polynomial kernel
0 references
splitters
0 references
0 references
0 references
