Sciweavers

5606 search results - page 58 / 1122
» Randomization Techniques for Graphs.
Sort
View
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
13 years 10 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
ICDT
2007
ACM
87views Database» more  ICDT 2007»
14 years 3 months ago
Query Evaluation on a Database Given by a Random Graph
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
Nilesh N. Dalvi
CIKM
2009
Springer
14 years 3 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
INFOCOM
2006
IEEE
14 years 3 months ago
On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
Vivek Vishnumurthy, Paul Francis
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
13 years 9 months ago
Short Cycles in Random Regular Graphs
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
Brendan D. McKay, Nicholas C. Wormald, Beata Wysoc...