425 search results - page 55 / 85 » Path Coloring on the Mesh |
136
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—In this paper, we propose a novel transport protocol that effectively utilizes available bandwidth and diversity gains provided by heterogeneous, highly lossy paths. Our Multi-P...
111
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
115
click to vote
IMC
2003
ACM
15 years 7 months ago
2003
ACM
Time-varying congestion on Internet paths and failures due to software, hardware, and configuration errors often disrupt packet delivery on the Internet. Many aproaches to avoidi...
107
Voted
STACS
2009
Springer
15 years 8 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
122
Voted
JCO
2011
14 years 8 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...