A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
From MaRDI portal
Publication:2032354
DOI10.1007/s00453-021-00806-xWikidataQ115606747 ScholiaQ115606747MaRDI QIDQ2032354
Meirav Zehavi, Roohani Sharma, Jayakrishnan Madathil
Publication date: 11 June 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10972/
tournament; polynomial kernel; FPT algorithm; semicomplete digraph; bisection; splitters; chromatic coding