5606 search results - page 27 / 1122 » Randomization Techniques for Graphs. |
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
COMBINATORICS
2002
13 years 7 months ago
2002
A sink-free orientation of a finite undirected graph is a choice of orientation
WG
1999
Springer
14 years 4 days ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
TKDE
2012
11 years 10 months ago
2012
— Most proposed DHTs engage certain topology maintenance mechanisms specific to the static graphs on which they are based. The designs of these mechanisms are complicated and rep...