91 search results - page 3 / 19 » Routing Flow Through a Strongly Connected Graph |
140
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
127
click to vote
TCC
2009
Springer
16 years 4 months ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
112
click to vote
WCNC
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper, a cooperative transmission design for a multi-node wireless cluster network is presented. It is assumed that the nodes operate in half-duplex mode and that channe...
133
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
178
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...