97 search results - page 16 / 20 » Cycles, Paths, Connectivity and Diameter in Distance Graphs |
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
CAI
2002
Springer
13 years 7 months ago
2002
Springer
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...
TON
2010
13 years 6 months ago
2010
—p-Cycles have been proposed for preprovisioned 1 : N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the ...
ARSCOM
1998
13 years 7 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
SODA
2007
ACM
13 years 9 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...