This survey provides a guiding reference to researchers seeking an overview of the large
body of literature about graph spanners. It surveys the current literature covering various …

Distributed computing concerns environments in which many processors, located at different
sites, must operate in a noninterfering and cooperative manner. Each of the processors …

Given a graph G=(V, E), a subgraph Gapos;=(V, Eapos;) is at‐spanner of G if for every u, v∈
V, the distance from u to v in Gapos; is at most t times longer than that distance in G. This …

For every ϵ> 0 and every integer m> 0, we construct explicitly graphs with O (m/ϵ) vertices
and maximum degree O (1 ϵ 2), such that after removing any (1− ϵ) portion of their vertices …

Four different communication problems are addressed in Boolean n-cube configured
multiprocessors:(1) one-to-all broadcasting: distribution of common data from a single …

Undertakes a comparative study of two important interconnection network topologies: the
star graph and the hypercube, from the graph theory point of view. Topological properties …

A tree t-spanner T of a graph G is a spanning tree in which the distance between every pair
of vertices is at most t times their distance in G. This notion is motivated by applications in …

Publisher Summary This chapter focuses on general purpose parallel architectures.
Multiprocessor parallel computation has been considered in the context of problems with …

Abstract Let G=(V, E) be an undirected weighted graph on| V|= n vertices and| E|= m edges.
A t‐spanner of the graph G, for any t≥ 1, is a subgraph (V, ES), ES⊆ E, such that the …

Let G=(V, E) be an n-vertex connected graph with positive edge weights. A subgraph
G′=(V, E′) is a t-spanner of G if for all u, v ε V, the weighted distance between u and v in …