Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
type: Item
instance of: scholarly article
title: Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
zbMATH Open document ID: 1211.05065
author: Frederic Dorn
author: Jan Arne Telle
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5702589
zbMATH Keywords: dynamic programming
zbMATH Keywords: tree-decomposition
zbMATH Keywords: branch-decomposition
zbMATH Keywords: path-decomposition
zbMATH Keywords: dominating set
zbMATH Keywords: brachwidth
zbMATH Keywords: treewidth
MaRDI profile type: Publication
full work available at URL: j.dam.2008.08.023
OpenAlex ID: W2003591274
cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
cites work: Q3044360
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Q4699283
cites work: Tour merging via branch-decomposition
cites work: Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
cites work: Algorithms – ESA 2005
cites work: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
cites work: Automata, Languages and Programming
cites work: STACS 2004
cites work: \(K_{1,3}\)-free and \(W_4\)-free graphs
cites work: Q4352948
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
DOI: 10.1016/J.DAM.2008.08.023
description: scientific article; zbMATH DE number 5702589