Computing the treewidth and the minimum fill-in with the modular decomposition
type: Item
instance of: scholarly article
title: Computing the treewidth and the minimum fill-in with the modular decomposition
zbMATH Open document ID: 1045.68151
author: Udi Rotics
author: Hans L. Bodlaender
published in: Algorithmica
publication date: 2003-08-19T00:00:00Z
full work available at URL: http://dspace.library.uu.nl/handle/1874/23972
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1967774
zbMATH Keywords: Treewidth
zbMATH Keywords: Minimum fill-in
zbMATH Keywords: Modular decomposition
zbMATH Keywords: Minimal separators
zbMATH Keywords: Polynomial algorithms
zbMATH Keywords: Graph algorithms
Wikidata QID: Q59567877
MaRDI profile type: Publication
OpenAlex ID: W2055691408
DOI: 10.1007/S00453-003-1026-5
DBLP publication ID: journals/algorithmica/BodlaenderR03
description: scientific article; zbMATH DE number 1967774