425 search results - page 4 / 85 » Path Coloring on the Mesh |
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...
110
click to vote
PAAPP
1998
14 years 11 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
102
click to vote
VISUALIZATION
1999
IEEE
15 years 3 months ago
1999
IEEE
In this paper we present a mesh compression method based on a multiresolution decomposition whose detail coefficients have a compact representation and thus smaller entropy than t...
JGT
2006
14 years 11 months ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract –The access link contention can severely constrain the endto-end throughput of the path between a source and destination mobile node connected through the backbone of th...