Graph separators: A parameterized view
type: Item
instance of: scholarly article
title: Graph separators: A parameterized view
zbMATH Open document ID: 1091.68075
DOI: 10.1016/S0022-0000(03)00072-2
author: Henning Fernau
author: Jochen Alber
author: Rolf Niedermeier
published in: Journal of Computer and System Sciences
publication date: 2004-08-19T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2092875
zbMATH Keywords: Planar graph problems
zbMATH Keywords: Fixed parameter tractability
zbMATH Keywords: Parameterized complexity
zbMATH Keywords: Graph separator theorems
zbMATH Keywords: Divide-and-conquer algorithms
MaRDI profile type: Publication
cites work: Q2721971
cites work: Q4779138
cites work: Q3046487
cites work: Q4551370
cites work: Q4535799
cites work: Faster exact algorithms for hard problems: A parameterized point of view
cites work: Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
cites work: A Separator Theorem for Nonplanar Graphs
cites work: Q3221758
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Vertex cover: Further observations and further improvements
cites work: Approximation algorithms for independent sets in map graphs
cites work: Map graphs
cites work: On the Problem of Partitioning Planar Graphs
cites work: Q3737448
cites work: Reduced constants for simple cycle graph separation
cites work: Q4503944
cites work: Diameter and treewidth in minor-closed graph families
cites work: Q4474097
cites work: Q4198056
cites work: A Separator Theorem for Planar Graphs
cites work: Applications of a Planar Separator Theorem
cites work: Vertex packings: Structural properties and algorithms
cites work: Q4251072
cites work: Q4472490
cites work: An application of the planar separator theorem to counting problems
cites work: Q4228512
cites work: Algorithms for maximum independent sets
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
cites work: Edge Dominating Sets in Graphs
full work available at URL: s0022-0000(03)00072-2
OpenAlex ID: W2077357506
description: scientific article; zbMATH DE number 2092875