214 search results - page 2 / 43 » Note on Sparse Random Graphs and Cover Graphs |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
COMBINATORICA
2002
13 years 5 months ago
2002
JCT
2007
13 years 5 months ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...
ALGORITHMICA
2010
13 years 5 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...