3958 search results - page 465 / 792 » Dynamic Graph Algorithms with Applications |
173
click to vote
ICNP
2007
IEEE
16 years 29 days ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
161
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
176
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
167
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
172
click to vote
IPSN
2004
Springer
16 years 21 hour ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...