eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2024-09-23
104:1
104:13
10.4230/LIPIcs.ESA.2024.104
article
Solving Directed Multiway Cut Faster Than 2ⁿ
Xiao, Mingyu
1
https://orcid.org/0000-0002-1012-2373
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
In the Directed Multiway Cut problem, we are given a directed graph G = (V,E) and a subset T ⊆ V, called the terminal set. The aim is to find a minimum sized set S ⊆ V⧵ T, such that after deleting S, no directed path exists from one terminal to another terminal in the remaining graph. It has been an open question whether Directed Multiway Cut can be solved faster than the trivial running-time bound O^*(2^{|V|}). In this paper, we provide a positive answer to this question, presenting an algorithm with a running-time bound O(1.9967^{|V|}).
https://drops.dagstuhl.de/storage/00lipics/lipics-vol308-esa2024/LIPIcs.ESA.2024.104/LIPIcs.ESA.2024.104.pdf
Exact Algorithms
Parameterized Algorithms
Directed Multiway Cut
Directed Multicut
Directed Graphs