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...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on computing Vol. 21; no. 1; pp. 193 - 201
Main Author:	Linial, Nathan
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.02.1992
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!