Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,599,883 papers from all fields of science
Search
Sign In
Create Free Account
Graph bandwidth
Known as:
Bandwidth problem
, Bandwidth
, Width (disambiguation)
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
1-planar graph
Adjacency matrix
Approximation algorithm
Caterpillar tree
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient
V. Cadambe
,
S. Jafar
,
H. Maleki
arXiv.org
2010
Corpus ID: 15251344
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…
Expand
2010
2010
A simple approach to reducing mutual coupling in two closely-spaced electrically small antennas
Jiang Zhu
,
G. Eleftheriades
IEEE Antennas and Propagation Society…
2010
Corpus ID: 30969792
The development of the next-generation wireless communication systems requires broadband and multi-band devices for faster data…
Expand
2009
2009
Dual-Band EBG Sectoral Antenna Using a Single-Layer FSS for UMTS Application
M. Hajj
,
E. Rodes
,
T. Monediere
IEEE Antennas and Wireless Propagation Letters
2009
Corpus ID: 37654003
In this letter, we present a novel approach to design a novel dual-band sectoral antenna by combining metallic electromagnetic…
Expand
2008
2008
Power efficient 4.5Gbit/s optical receiver in 130nm CMOS with integrated photodiode
F. Tavernier
,
M. Steyaert
European Solid-State Circuits Conference
2008
Corpus ID: 11778655
An optical receiver with integrated photodiode in 130 nm CMOS is presented. The extremely unfavourable optical and electrical…
Expand
2007
2007
An Efficient Scheme for Solving Bandwidth Guaranteed Scheduling and Shortest path Routing Problem in Wireless Mesh Networks
Ziming Zeng
,
Yuanyuan Zeng
2007
Corpus ID: 17401178
Summary The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the…
Expand
2006
2006
Architecture and Compiler Optimizations for Data Bandwidth Improvement in Configurable Processors
J. Cong
,
Guoling Han
,
Zhiru Zhang
IEEE Transactions on Very Large Scale Integration…
2006
Corpus ID: 13982826
Many commercially available embedded processors are capable of extending their base instruction set for a specific domain of…
Expand
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
S. Randel
,
S. Lee
,
+5 authors
A. Kirstädter
2006
Corpus ID: 110268969
Transmission of 1 Gbit/s over 100 m of SI-POF is demonstrated. To the authors’ knowledge this sets a new record. The bandwidth…
Expand
2005
2005
Architecture and compilation for data bandwidth improvement in configurable embedded processors
J. Cong
,
Guoling Han
,
Zhiru Zhang
ICCAD. IEEE/ACM International Conference on…
2005
Corpus ID: 1150679
Many commercially available embedded processors are capable of extending their base instruction set for a specific domain of…
Expand
2004
2004
A centroid-based approach to solve the bandwidth minimization problem
A. Lim
,
B. Rodrigues
,
Fei Xiao
37th Annual Hawaii International Conference on…
2004
Corpus ID: 6992218
We propose a node centroid method with Hill-Climbing to solve the well-known matrix bandwidth minimization problem, which is to…
Expand
2002
2002
Some new disk scheduling policies and their performance
Alexander Thomasian
,
Chang Liu
Measurement and Modeling of Computer Systems
2002
Corpus ID: 9592807
Advances in magnetic recording technology have resulted in a rapid increase in disk capacities, but improvements in the…
Expand
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)
ACCEPT & CONTINUE