Computing the branchwidth of interval graphs
type: Item
instance of: scholarly article
title: Computing the branchwidth of interval graphs
zbMATH Open document ID: 1084.05068
author: Ton Kloks
author: Jan Kratochvíl
author: Haiko Müller
published in: Discrete Applied Mathematics
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 2136946
MaRDI profile type: Publication
full work available at URL: j.dam.2004.01.015
OpenAlex ID: W2059394539
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Q3758844
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Treewidth and Minimum Fill-in on d-Trapezoid Graphs
cites work: Constructive linear time algorithms for branchwidth
cites work: Graphs with Branchwidth at Most Three
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Treewidth and minimum fill-in: Grouping the minimal separators
cites work: A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
cites work: Q4198056
cites work: Q3328583
cites work: Treewidth. Computations and approximations
cites work: Q4251049
cites work: Upper bounds on the size of obstructions and intertwines
cites work: Q4385515
cites work: Q4352948
cites work: Graph minors. I. Excluding a forest
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Call routing and the ratcatcher
DOI: 10.1016/J.DAM.2004.01.015
description: scientific article; zbMATH DE number 2136946