Sciweavers

420 search results - page 13 / 84
» Generating random regular graphs
Sort
View
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
15 years 5 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...
128
Voted
RSA
2011
126views more  RSA 2011»
14 years 11 months ago
Local resilience of almost spanning trees in random graphs
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
József Balogh, Béla Csaba, Wojciech ...
119
Voted
RSA
2006
88views more  RSA 2006»
15 years 4 months ago
Randomly coloring sparse random graphs with fewer colors than the maximum degree
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze...
IEEECIT
2010
IEEE
15 years 2 months ago
Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the
Abstract—In this paper, we propose efficient routing algorithms for collective communication in a newly proposed, versatile network, called a recursive dual-net (RDN). The RDN c...
Yamin Li, Shietung Peng, Wanming Chu
89
Voted
APPROX
2007
Springer
60views Algorithms» more  APPROX 2007»
15 years 10 months ago
A Sequential Algorithm for Generating Random Graphs
Mohsen Bayati, Jeong Han Kim, Amin Saberi