ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...