320 search results - page 42 / 64 » Rigorous Result for the CHKNS Random Graph Model |
110
click to vote
ESA
2005
Springer
15 years 5 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
105
click to vote
WDAG
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
ASM
2005
ASM
15 years 5 months ago
2005
ASM
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...
GD
1998
Springer
15 years 4 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...