We study the problem Symmetric Directed Multicut from a parameterized complexity per- spective. In this problem, the input is a digraph D, a set of cut requests ...

Aug 18, 2022 · We study the problem Symmetric Directed Multicut from a parameterized complexity perspective. In this problem, the input is a digraph D, a set of cut requests.

Dec 14, 2022 · We study the problem Symmetric Directed Multicut from a parameterized complexity perspective. In this problem, the input is a digraph D, a set ...

Aug 18, 2022 · We study the problem Symmetric Directed Multicut from a parameterized complexity per- spective. In this problem, the input is a digraph D, a set ...

We study the problem Symmetric Directed Multicut from a parameterized complexity perspective. In this problem, the input is a digraph $D$, a set of cut ...

Dec 14, 2022 · On the Parameterized Complexity of Symmetric Directed Multicut. / Eiben, Eduard; Rambaud, Clément; Wahlström, Magnus. IPEC 2022. Vol. 249 ...

TL;DR: This study reveals Directed Symmetric Multicut as the next important graph separation problem whose parameterized complexity remains unknown, even in the ...

Oct 9, 2023 · Our algorithm works by reducing the problem into a Boolean MinCSP, which is in turn solved by flow augmentation. For the lower bounds, we prove ...

On the Parameterized Complexity of Symmetric Directed Multicut. 2022, Leibniz International Proceedings in Informatics, LIPIcs. View all citing articles on ...

The directed flow-augmentation tool allows us to prove fixed-parameter tractability of a number of problems parameterized by the cardinality of the deletion ...