This chapter addresses three basic graph problems encountered in the context of distributed systems. These problems are (a) the computation of the shortest paths between a pair of processes where a positive length (or weight) is attached to each communication channel, (b) the coloring of the vertices (processes) of a graph in + 1 colors (where is the maximal number of neighbors of a process, i.e., the maximal degree of a vertex when using the graph terminology), and (c) the detection of knots and cycles in a graph. As for the previous chapter devoted to graph traversal algorithms, an aim of this chapter is not only to present specific distributed graph algorithms, but also to show that their design is not always obtained from a simple extension of their sequential counterparts.
CITATION STYLE
Raynal, M. (2013). Distributed Graph Algorithms. In Distributed Algorithms for Message-Passing Systems (pp. 35–58). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-38123-2_2
Mendeley helps you to discover research relevant for your work.