139 search results - page 6 / 28 » Bandwidth on AT-Free Graphs |
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The common utilization-based definition of available bandwidth and many of the existing tools to estimate it suffer from several important weaknesses: i) most tools report a point...
BROADNETS
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract—To reap the benefits of advances in wireless technologies as well as provide backward compatibility with current investments, future wireless routers that constitute th...
COMGEO
2007
ACM
13 years 9 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
WG
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...