Parameterized complexity of multicut in weighted trees

In the Multicut problem, given an undirected graph G, a set of pairs of vertices P, and a budget k, the goal is to determine if there is a set S of at most k edges such that for each (s,t)∈P, the graph G−S has no path from s to t. In this article we first study the parameterized complexity of a vari...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 978; S. 114174
Hauptverfasser:	Galby, Esther, Marx, Dániel, Schepper, Philipp, Sharma, Roohani, Tale, Prafullkumar
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 02.11.2023
Schlagworte:	Directed flow augmentation Multicut in weighted trees Weighted digraph pair cut Multicut in weighted trees Weighted digraph pair cut Directed flow augmentation
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!