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.
Highly Cited
2010
Highly Cited
2010
We consider a set up where a file of size M is stored in n distributed storage nodes, using an (n,k) minimum storage regenerating… 
2010
2010
The development of the next-generation wireless communication systems requires broadband and multi-band devices for faster data… 
2009
2009
In this letter, we present a novel approach to design a novel dual-band sectoral antenna by combining metallic electromagnetic… 
2008
2008
An optical receiver with integrated photodiode in 130 nm CMOS is presented. The extremely unfavourable optical and electrical… 
2007
2007
Summary The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the… 
2006
2006
Many commercially available embedded processors are capable of extending their base instruction set for a specific domain of… 
2006
2006
Transmission of 1 Gbit/s over 100 m of SI-POF is demonstrated. To the authors’ knowledge this sets a new record. The bandwidth… 
2005
2005
Many commercially available embedded processors are capable of extending their base instruction set for a specific domain of… 
2004
2004
We propose a node centroid method with Hill-Climbing to solve the well-known matrix bandwidth minimization problem, which is to… 
2002
2002
Advances in magnetic recording technology have resulted in a rapid increase in disk capacities, but improvements in the…