The parameterized complexity landscape of finding 2-partitions of digraphs

DOI10.1016/j.tcs.2019.05.037zbMath1434.68205OpenAlexW2955239410MaRDI QIDQ2330099

Kristine V. K. Knudsen, Meirav Zehavi, Saket Saurabh, Jörgen Bang-Jensen

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

zbMATH Keywords

directed graphsparameterized complexity2-partitiondigraph partitioning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

On the parameterized complexity of 2-partitions

Cites Work

• Unnamed Item
• Finding good 2-partitions of digraphs. I. Hereditary properties
• On the complexity of partitioning graphs into connected subgraphs
• Splitting a graph into disjoint induced paths or cycles.
• Finding good 2-partitions of digraphs. II. Enumerable properties
• Partitioning Graphs into Connected Parts
• Splitting digraphs
• Parameterized Algorithms

This page was built for publication: The parameterized complexity landscape of finding 2-partitions of digraphs