Sciweavers

139 search results - page 2 / 28
» Bandwidth on AT-Free Graphs
Sort
View
TCS
2008
13 years 5 months ago
On the bandwidth of 3-dimensional Hamming graphs
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
J. Balogh, Sergei L. Bezrukov, L. H. Harper, &Aacu...
ISAAC
2009
Springer
95views Algorithms» more  ISAAC 2009»
13 years 12 months ago
Bandwidth on AT-Free Graphs
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch,...
JCT
2008
109views more  JCT 2008»
13 years 5 months ago
Spanning 3-colourable subgraphs of small bandwidth in dense graphs
A conjecture by Bollob
Julia Böttcher, Mathias Schacht, Anusch Taraz
APPROX
1998
Springer
150views Algorithms» more  APPROX 1998»
13 years 9 months ago
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
Vijay Kumar