Graph bandwidth of weighted caterpillars
type: Item
instance of: scholarly article
title: Graph bandwidth of weighted caterpillars
zbMATH Open document ID: 1110.68110
author: Mingen Lin
author: Zhiyong Lin
author: Jinhui Xu
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5083515
zbMATH Keywords: algorithm
zbMATH Keywords: linear layout
zbMATH Keywords: caterpillar
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.07.015
OpenAlex ID: W2035656984
cites work: The Bandwidth of Caterpillars with Hairs of Length 1 and 2
cites work: The bandwidth problem for graphs and matrices—a survey
cites work: Approximating layout problems on random geometric graphs
cites work: Approximating the bandwidth via volume respecting embeddings
cites work: Complexity Results for Bandwidth Minimization
cites work: Improved bandwidth approximation for trees and chordal graphs
cites work: Bandwidth Minimization: An approximation algorithm for caterpillars
cites work: Bandwidth of chain graphs
cites work: The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
cites work: The NP-completeness of the bandwidth minimization problem
cites work: An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs
DOI: 10.1016/J.TCS.2006.07.015
Recommended article: Algorithmic Applications in Management
Recommended article: Q3328586
Recommended article: Bandwidth of chain graphs
Recommended article: Bounding the bandwidths for graphs
Recommended article: Edge-Bandwidth of Graphs
Recommended article: Q3731639
Recommended article: On bandwidth sums of graphs
Recommended article: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Recommended article: Approximating the bandwidth of caterpillars
Recommended article: On the size of graphs of a given bandwidth
description: scientific article; zbMATH DE number 5083515