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)

Related topics

Related topics

25 relations
1-planar graphAdjacency matrixApproximation algorithmCaterpillar tree

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Dual-Band EBG Sectoral Antenna Using a Single-Layer FSS for UMTS Application
In this letter, we present a novel approach to design a novel dual-band sectoral antenna by combining metallic electromagnetic… 
2008
2008
Power efficient 4.5Gbit/s optical receiver in 130nm CMOS with integrated photodiode
An optical receiver with integrated photodiode in 130 nm CMOS is presented. The extremely unfavourable optical and electrical… 
Highly Cited
2008
Highly Cited
2008
Design and implementation of the Smith-Waterman algorithm on the CUDA-compatible GPU
This paper describes a design and implementation of the Smith-Waterman algorithm accelerated on the graphics processing unit (GPU… 
2006
2006
Architecture and Compiler Optimizations for Data Bandwidth Improvement in Configurable Processors
Many commercially available embedded processors are capable of extending their base instruction set for a specific domain of… 
2006
2006
1 Gbit/s transmission with 6.3 bit/s/Hz spectral efficiency in a 100m standard 1 mm step-index plastic optical fibre link using adaptive multiple sub-carrier modulation
Transmission of 1 Gbit/s over 100 m of SI-POF is demonstrated. To the authors’ knowledge this sets a new record. The bandwidth… 
Highly Cited
2005
Highly Cited
2005
Moving object detection in wavelet compressed video
2004
2004
A centroid-based approach to solve the bandwidth minimization problem
We propose a node centroid method with Hill-Climbing to solve the well-known matrix bandwidth minimization problem, which is to… 
2002
2002
Some new disk scheduling policies and their performance
Advances in magnetic recording technology have resulted in a rapid increase in disk capacities, but improvements in the… 
Highly Cited
2001
Highly Cited
2001
High-Performance DRAMs in Workstation Environments
This paper presents a simulation-based performance study of several of the new high-performance DRAM architectures, each… 
Highly Cited
1989
Highly Cited
1989
Parameterizable VLSI architectures for the full-search block-matching algorithm
Systolic VLSI architectures for implementing the full-search block-matching algorithm are described. A large range of data rates… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)