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 ...
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...
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...
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 ...