Graph bandwidth

Known as: Bandwidth problem, Bandwidth, Width (disambiguation) 
In graph theory, the graph bandwidth problem is to label the n vertices vi of a graph G with distinct integers f(vi) so that the quantity is… (More)
Wikipedia

Related topics

Related topics

25 relations
1-planar graphAdjacency matrixApproximation algorithmCaterpillar tree
(More)

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
On semidefinite programming bounds for graph bandwidth
We propose two new lower bounds on graph bandwidth and cyclic bandwidth based on semidefinite programming (SDP) relaxations of… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2010
2010
A Lossless Embedded Compression Using Significant Bit Truncation for HD Video Coding
Increasing the image size of a video sequence aggravates the memory bandwidth problem of a video coding system. Despite many… (More)
Is this relevant?
2009
2009
Generalized Gene Adjacencies, Graph Bandwidth, and Clusters in Yeast Evolution
We present a parameterized definition of gene clusters that allows us to control the emphasis placed on conserved order within a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Graph Bandwidth of Weighted Caterpillars
Graph bandwidth minimization (GBM) is a classical and challenging problem in graph algorithms and combinatorial optimization… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Moving object detection in wavelet compressed video
In many surveillance systems the video is stored in wavelet compressed form. In this paper, an algorithm for moving object and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a… (More)
Is this relevant?
1998
1998
Bandwidth and density for block graphs
The bandwidth of a graph G is the minimum of the maximum diier-ence between adjacent labels when the vertices have distinct… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Access Ordering and Memory-Conscious Cache Utilization
As processor speeds increase relative to memory speeds, memory bandwidth is rapidly becoming the limiting performance factor for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1995
1995
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
We show that there is an O(n3) algorithm to approximate the bandwidth of an AT-free graph with worst case performance ratio 2… (More)
  • figure 1
Is this relevant?
1990
1990
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph… (More)
  • figure 1
  • figure 2
Is this relevant?