249 search results - page 1 / 50 » Approximating the Bandwidth of Caterpillars |
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
JCSS
2011
13 years 7 days ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
ECRTS
2009
IEEE
13 years 3 months ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
SI3D
2012
ACM
12 years 25 days ago
2012
ACM
Shading complex materials such as acquired reflectances in multilight environments is computationally expensive. Estimating the shading integral requires multiple samples of the ...
ISCA
2011
IEEE
12 years 9 months ago
2011
IEEE
In recent years, the increasing number of processor cores and limited increases in main memory bandwidth have led to the problem of the bandwidth wall, where memory bandwidth is b...