Sciweavers

198 search results - page 1 / 40
» A Sequential Algorithm for Generating Random Graphs
Sort
View
56
Voted
APPROX
2007
Springer
60views Algorithms» more  APPROX 2007»
15 years 5 months ago
A Sequential Algorithm for Generating Random Graphs
Mohsen Bayati, Jeong Han Kim, Amin Saberi
84
Voted
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
15 years 5 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
CORR
2008
Springer
103views Education» more  CORR 2008»
14 years 11 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi
TCAD
2002
145views more  TCAD 2002»
14 years 10 months ago
Automatic generation of synthetic sequential benchmark circuits
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil
80
Voted
WAW
2004
Springer
96views Algorithms» more  WAW 2004»
15 years 4 months ago
A Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
Abraham Flaxman, Alan M. Frieze, Juan Vera