245 search results - page 35 / 49 » Group connectivity of graphs with diameter at most 2 |
DIALM
2003
ACM
14 years 26 days ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
IPTPS
2004
Springer
14 years 29 days ago
2004
Springer
Structured peer-to-peer (p2p) overlay networks provide a decentralized, self-organizing substrate for distributed applicad support powerful abstractions such as distributed hash t...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
DIALM
2003
ACM
14 years 26 days ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
ICALP
2001
Springer
14 years 2 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...