102 search results - page 6 / 21 » Geometric properties of Assur graphs |
INFOCOM
2012
IEEE
11 years 9 months ago
2012
IEEE
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
ICALP
1992
Springer
13 years 11 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
DCG
2011
13 years 2 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
WAW
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a new geometric, rank-based model for the link structure of on-line social networks (OSNs). In the geo-protean (GEO-P) model for OSNs nodes are identified with points ...