Reduction algorithms for graphs of small treewidth
type: Item
instance of: scholarly article
title: Reduction algorithms for graphs of small treewidth
zbMATH Open document ID: 1008.05140
author: Babette van Antwerpen-de Fluiter
author: Hans L. Bodlaender
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
full work available at URL: https://dspace.library.uu.nl/handle/1874/17374
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 1853179
Wikidata QID: Q59567926
MaRDI profile type: Publication
OpenAlex ID: W1973347908
cites work: Q4273870
cites work: An algebraic theory of graph reduction
cites work: Easy problems for tree-decomposable graphs
cites work: Characterization and Recognition of Partial 3-Trees
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Parallel Algorithms with Optimal Speedup for Bounded Treewidth
cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q4255109
cites work: Topology of series-parallel networks
cites work: Q4023519
cites work: Characterization of partial 3-trees in terms of three structures
cites work: Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
cites work: Q4036591
cites work: Algorithms finding tree-decompositions of graphs
cites work: The Recognition of Series Parallel Digraphs
DOI: 10.1006/INCO.2000.2958
description: scientific article; zbMATH DE number 1853179