Sciweavers

214 search results - page 6 / 43
» Note on Sparse Random Graphs and Cover Graphs
Sort
View
ICALP
2005
Springer
14 years 1 months ago
On the Cover Time of Random Geometric Graphs
Chen Avin, Gunes Ercal
CC
2007
Springer
13 years 7 months ago
The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs
Paul Beame, Russell Impagliazzo, Ashish Sabharwal
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 8 months ago
The Degree Distribution of Random k-Trees
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
Yong Gao
RSA
2011
124views more  RSA 2011»
13 years 2 months ago
Sparse random graphs with clustering
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...
Béla Bollobás, Svante Janson, Oliver...
COMBINATORICS
2000
112views more  COMBINATORICS 2000»
13 years 7 months ago
A Note on Random Minimum Length Spanning Trees
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning...
Alan M. Frieze, Miklós Ruszinkó, Lub...