Parameterized graph separation problems
type: Item
instance of: scholarly article
title: Parameterized graph separation problems
zbMATH Open document ID: 1086.68104
author: Dániel Marx
published in: Theoretical Computer Science
publication date: 2006-04-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5017475
zbMATH Keywords: parameterized complexity
zbMATH Keywords: separator
zbMATH Keywords: multicut
zbMATH Keywords: multiway cut
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.10.007
OpenAlex ID: W2121641644
cites work: Q3056948
cites work: Finding and counting given length cycles
cites work: Finding good approximate vertex and edge partitions is NP-hard
cites work: Tight lower bounds for certain parameterized NP-hard problems
cites work: Q4035360
cites work: The Complexity of Multiterminal Cuts
cites work: Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems
cites work: Q4393480
cites work: Primal-dual approximation algorithms for integral flow and multicut in trees
cites work: Multiway cuts in node weighted graphs
cites work: Q3396009
cites work: A Separator Theorem for Planar Graphs
cites work: Applications of a Planar Separator Theorem
cites work: Q5710169
DOI: 10.1016/J.TCS.2005.10.007
description: scientific article; zbMATH DE number 5017475