Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
Bill Jackson, Brigitte Servatius, Herman Servatius
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...