The online graph bandwidth problem
type: Item
instance of: scholarly article
title: The online graph bandwidth problem
zbMATH Open document ID: 0752.68060
DOI: 10.1016/0890-5401(92)90012-5
author: Raymond Board
published in: Information and Computation
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 93301
zbMATH Keywords: graph bandwidth problem
zbMATH Keywords: online algorithm
zbMATH Keywords: lower bounds
MaRDI profile type: Publication
full work available at URL: 0890-5401(92)90012-5
OpenAlex ID: W2031103633
cites work: Effective coloration
cites work: Lower bounds for on-line two-dimensional packing algorithms
cites work: Recursive coloration of countable graphs
cites work: New Ressults on Server Problems
cites work: A provably efficient algorithm for dynamic storage allocation
cites work: Q4198056
cites work: On-line and first fit colorings of graphs
cites work: An Effective Version of Dilworth's Theorem
cites work: Q4722060
cites work: The Linearity of First-Fit Coloring of Interval Graphs
cites work: Competitive algorithms for server problems
cites work: The NP-completeness of the bandwidth minimization problem
cites work: On the Probable Performance of Heuristics for Bandwidth Minimization
cites work: New Algorithms for Bin Packing
Recommended article: The bandwidth problem and operations on graphs
Recommended article: Q3839788
Recommended article: Q3328586
Recommended article: Q2721963
Recommended article: Q4439289
Recommended article: Bounding the bandwidths for graphs
Recommended article: On the size of graphs of a given bandwidth
Recommended article: A randomized online algorithm for bandwidth utilization
Recommended article: Q4828980
Recommended article: On bandwidth-2 graphs
description: scientific article; zbMATH DE number 93301