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...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 978; p. 114174
Main Authors:	Galby, Esther, Marx, Dániel, Schepper, Philipp, Sharma, Roohani, Tale, Prafullkumar
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 02.11.2023
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!