Part of the Texts and Monographs in Computer Science book series (MCS)
A Class of Simple Communication Patterns
We consider a finite, undirected graph each node of which contains a process. Processes contained in nodes directly connected by an edge of the graph are called each other’s neighbours.
Unable to display preview. Download preview PDF.
© Springer-Verlag New York Inc. 1982