632 search results - page 69 / 127 » On Routing in Circulant Graphs |
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
TCC
2009
Springer
15 years 10 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...
ECCC
2006
14 years 10 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
COCOA
2009
Springer
15 years 2 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
103
click to vote
ISCC
1999
IEEE
15 years 2 months ago
1999
IEEE
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...