425 search results - page 14 / 85 » Path Coloring on the Mesh |
102
click to vote
COLOGNETWENTE
2009
15 years 24 days ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
104
click to vote
AAIM
2005
Springer
15 years 5 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
ICC
2008
IEEE
15 years 6 months ago
2008
IEEE
— Wireless routers equipped with smart antennas are capable of forming beams to neighboring devices to transmit/receive multiple packets simultaneously, hence achieving high netw...
SIGGRAPH
1996
ACM
15 years 3 months ago
1996
ACM
Multiresolution analysis has been proposed as a basic tool supporting compression, progressive transmission, and level-of-detail control of complex meshes in a unified and theoret...
149
click to vote
HPCA
1997
IEEE
15 years 3 months ago
1997
IEEE
This paper compares the performance of hierarchical ring- and mesh-connected wormhole routed shared memory multiprocessor networks in a simulation study. Hierarchical rings are in...