Lower bounds on treespan
type: Item
instance of: scholarly article
title: Lower bounds on treespan
zbMATH Open document ID: 1181.68178
author: Dieter Rautenbach
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5650133
zbMATH Keywords: combinatorial problems
zbMATH Keywords: treespan
zbMATH Keywords: bandwidth
zbMATH Keywords: density lower bound
zbMATH Keywords: inert search
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.06.001
OpenAlex ID: W2006854418
cites work: The bandwidth problem for graphs and matrices—a survey
cites work: Graphs with small bandwidth and cutwidth
cites work: Graph searching, elimination trees, and a generalization of bandwidth
cites work: Optimal numberings and isoperimetric problems on graphs
cites work: Bandwidth and pebbling
cites work: Bandwidth of the complete \(k\)-ary tree
DOI: 10.1016/J.IPL.2005.06.001
description: scientific article; zbMATH DE number 5650133