Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The M<scp>inimum</scp> L<scp>inear</scp> A<scp>rrangement</scp> (MLA) problem involves embedding a given graph on the integer… 
Highly Cited
2011
Highly Cited
2011
  • K. Shum
  • 2011
  • Corpus ID: 2823180
When there are multiple storage node failures in distributed storage system, regenerating them individually is suboptimal as far… 
Highly Cited
2010
Highly Cited
2010
Memory bandwidth has become a major performance bottleneck as more and more cores are integrated onto a single die, demanding… 
Highly Cited
2010
Highly Cited
2010
Increasing the image size of a video sequence aggravates the memory bandwidth problem of a video coding system. Despite many… 
Highly Cited
2008
Highly Cited
2008
This paper describes a design and implementation of the Smith-Waterman algorithm accelerated on the graphics processing unit (GPU… 
2006
2006
Many commercially available embedded processors are capable of extending their base instruction set for a specific domain of… 
Highly Cited
2001
Highly Cited
2001
This paper presents a simulation-based performance study of several of the new high-performance DRAM architectures, each… 
Highly Cited
1989
Highly Cited
1989
Systolic VLSI architectures for implementing the full-search block-matching algorithm are described. A large range of data rates…