Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 207,943,776 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
Parallel Problem Solving from Nature - PPSN XI, 11th International Conference, Kraków, Poland, September 11-15, 2010. Proceedings, Part II
R. Schaefer
PPSN
2010
Corpus ID: 31878972
Multiobjective Optimization, Models and Applications.- A Novel Smart Multi-Objective Particle Swarm Optimisation Using…
Expand
Highly Cited
2005
Highly Cited
2005
The NP-Completeness of the bandwidth minimization problem
C. Papadimitriou
Computing
2005
Corpus ID: 41009685
The Problem of minimizing the bandwidth of the nonzero entries of a sparse symmetric matrix by permuting its rows and columns and…
Expand
Highly Cited
2005
Highly Cited
2005
Moving object detection in wavelet compressed video
B. U. Töreyin
,
A. Cetin
,
A. Aksay
,
M. B. Akhan
Signal processing. Image communication
2005
Corpus ID: 18260898
Highly Cited
2004
Highly Cited
2004
A complexity-effective approach to ALU bandwidth enhancement for instruction-level temporal redundancy
A. Parashar
,
S. Gurumurthi
,
A. Sivasubramaniam
Proceedings. 31st Annual International Symposium…
2004
Corpus ID: 5741846
Previous proposals for implementing instruction-level temporal redundancy in out-of-order cores have reported a performance…
Expand
Highly Cited
1995
Highly Cited
1995
Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results
A. B. Baker
1995
Corpus ID: 118256874
The Constraint Satisfaction Problem is a type of combinatorial search problem of much interest in Artificial Intelligence and…
Expand
Highly Cited
1993
Highly Cited
1993
Performance of a software MPEG video decoder
Ketan Patel
,
B. Smith
,
L. Rowe
MULTIMEDIA '93
1993
Corpus ID: 3773268
The design and implementation of a software decoder for MPEG video bitstreams is described. The software has been ported to…
Expand
1993
1993
Access Ordering and Effective Memory Bandwidth
S. Moyer
1993
Corpus ID: 15096413
High-performance scalar processors are characterized by multiple pipelined functional units that can be initiated simultaneously…
Expand
Highly Cited
1989
Highly Cited
1989
Parameterizable VLSI architectures for the full-search block-matching algorithm
L. Vos
,
M. Stegherr
1989
Corpus ID: 62414239
Systolic VLSI architectures for implementing the full-search block-matching algorithm are described. A large range of data rates…
Expand
Review
1982
Review
1982
The bandwidth problem for graphs and matrices - a survey
P. Chinn
,
J. Chvátalová
,
A. Dewdney
,
N. Gibbs
Journal of Graph Theory
1982
Corpus ID: 36770445
The bandwidth problem for a graph G is to label its n vertices vi with distinct integers f(vi) so that the quantity max{| f(vi…
Expand
Highly Cited
1978
Highly Cited
1978
COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION
M. Garey
,
R. Graham
,
David S. Johnson
,
D. Knuth
1978
Corpus ID: 121985887
We present a linear-time algorithm for sparse symmetric matrices which converts a matrix into pentadiagonal form (“bandwidth 2…
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