102 search results - page 6 / 21 » Geometric properties of Assur graphs |
159
click to vote
INFOCOM
2012
IEEE
13 years 6 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...
147
click to vote
ICALP
1992
Springer
15 years 8 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...
158
click to vote
DCG
2011
14 years 11 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...
131
click to vote
CORR
2006
Springer
15 years 4 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...
252
click to vote
WAW
2010
Springer
15 years 2 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 ...