Locality in Distributed Graph Algorithms

This paper concerns a number of algorithmic problems on graphs and how they may be solved in a distributed fashion. The computational model is such that each node of the graph is occupied by a processor which has its own ID. Processors are restricted to collecting data from others which are at a dis...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on computing Jg. 21; H. 1; S. 193 - 201
1. Verfasser:	Linial, Nathan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.02.1992
Schlagworte:	Algorithms Combinatorics Combinatorics. Ordered structures Computer science Distributed processing Exact sciences and technology Graph theory Graphs Labeling Mathematics Sciences and techniques of general use Algorithmics Lower bound Distributed processing Graph colouring Algorithm complexity
ISSN:	0097-5397, 1095-7111
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!