On treewidth approximations.
type: Item
instance of: scholarly article
title: On treewidth approximations.
zbMATH Open document ID: 1035.05087
DOI: 10.1016/S0166-218X(03)00440-2
author: Dieter Kratsch
author: Haiko Müller
author: Ioan Todinca
author: Vincent Bouchitté
published in: Discrete Applied Mathematics
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 2055504
zbMATH Keywords: Treewidth
zbMATH Keywords: Asteroidal number
zbMATH Keywords: Minimal separator
zbMATH Keywords: Graph algorithm
zbMATH Keywords: Approximation algorithm
MaRDI profile type: Publication
cites work: Q3056948
cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
cites work: Q2766670
cites work: Treewidth and minimum fill-in: Grouping the minimal separators
cites work: Listing all potential maximal cliques of a graph
cites work: A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
cites work: Fast Approximate Graph Partitioning Algorithms
cites work: Listing all Minimal Separators of a Graph
cites work: Approximating the Bandwidth for Asteroidal Triple-Free Graphs
cites work: On the structure of graphs with bounded asteroidal number
cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
cites work: Characterizations and algorithmic applications of chordal graph embeddings
cites work: Decomposition by clique separators
description: scientific article; zbMATH DE number 2055504