104 search results - page 7 / 21 » Witness (Delaunay) Graphs |
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
ICDCSW
2009
IEEE
14 years 2 months ago
2009
IEEE
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
ARSCOM
2007
13 years 8 months ago
2007
For any simple graph H, let σ(H, n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex...
ENTCS
2008
13 years 8 months ago
2008
Graphical notations are already popular for the design of software, as witnessed by the success of the Uniform Modeling Languages (UML). In this paper, we advocate the use of grap...
APVIS
2008
13 years 9 months ago
2008
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...