ABSTRACT
An important issue in distributed algorithms for graphs is that of static vs. dynamic topology. e topology is called static when it does not change. A topology that is not static is called dynamic-it is the result of spontaneous addition and deletion of nodes and edges, which reects real-life situations. Clearly, algorithms for dynamic topologies are more robust than those for static topologies only. In this chapter, we will study distributed algorithms for solving a few graph theoretic problems.
