5606 search results - page 159 / 1122 » Randomization Techniques for Graphs. |
CPC
2002
13 years 10 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
INFOVIS
2003
IEEE
14 years 4 months ago
2003
IEEE
Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed ...
SOCIALCOM
2010
13 years 8 months ago
2010
We introduce a novel technique for comparing graphs using the structure of their subgraphs, which we call a graph's fine structure. Our technique compares graphs using the ear...
MOBIQUITOUS
2007
IEEE
14 years 5 months ago
2007
IEEE
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
OPODIS
2008
14 years 7 days ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...