3131 search results - page 171 / 627 » Generalized connection caching |
139
click to vote
TON
2008
15 years 5 months ago
2008
This paper develops a framework to support multiple protection strategies in optical networks, which is in general applicable to any connection-oriented network. The capacity avail...
143
click to vote
JSC
2007
15 years 5 months ago
2007
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
138
click to vote
DM
2002
15 years 5 months ago
2002
Let ^G be a graph obtained from a graph G with no loops or coloops by replacing each edge e = uw of G by a connected graph He that has only the vertices u and w in common with the...
153
click to vote
JDA
2010
15 years 7 days ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
150
click to vote
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
Scalable Source Routing (SSR) is a self-organizing routing protocol designed for supporting peer-to-peer applications. It is especially suited for networks that do not have a well...