113 search results - page 6 / 23 » Rigid Components of Random Graphs |
ICALP
2003
Springer
13 years 12 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
RSA
2011
13 years 1 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
CPC
2010
13 years 4 months ago
2010
We study the diameter of C1, the largest component of the Erdos-R
ECML
2004
Springer
14 years 4 days ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
RSA
2011
13 years 1 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...