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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	SIAM journal on computing Ročník 21; číslo 1; s. 193 - 201
Hlavní autor:	Linial, Nathan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.02.1992
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!