Sciweavers

59 search results - page 3 / 12
» Generating Labeled Planar Graphs Uniformly at Random
Sort
View
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
14 years 5 months ago
Generating random regular graphs
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
Jeong Han Kim, Van H. Vu
RSA
2010
64views more  RSA 2010»
13 years 3 months ago
Vertices of given degree in series-parallel graphs
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
Michael Drmota, Omer Giménez, Marc Noy
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
13 years 11 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»
13 years 5 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
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
13 years 11 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen