The parameterized complexity landscape of finding 2-partitions of digraphs
From MaRDI portal
Publication:2330099
DOI10.1016/j.tcs.2019.05.037zbMath1434.68205MaRDI QIDQ2330099
Meirav Zehavi, Saket Saurabh, Jörgen Bang-Jensen, Kristine V. K. Knudsen
Publication date: 18 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.05.037
68R10: Graph theory (including graph drawing) in computer science
68Q27: Parameterized complexity, tractability and kernelization