139 search results - page 4 / 28 » Bandwidth on AT-Free Graphs |
162
click to vote
JCSS
2011
15 years 26 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...
133
click to vote
EOR
2008
15 years 6 months ago
2008
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
178
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
172
click to vote
PPSN
2004
Springer
15 years 11 months ago
2004
Springer
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...
149
click to vote
ISCC
2005
IEEE
15 years 11 months ago
2005
IEEE
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...