Interdisciplinary Information Sciences
Online ISSN : 1347-6157
Print ISSN : 1340-9050
ISSN-L : 1340-9050
Reviews and Lectures: Exploring the Limits of Computation II
Distributed Graph Algorithms and their Complexity: An Introduction
Taisuke IZUMI
Author information
JOURNAL FREE ACCESS

2015 Volume 21 Issue 4 Pages 351-370

Details
Abstract

Distributed graph algorithms are the methods for solving graph problems defined over networks of computers, where each vertex is a computing entity (i.e., process) and an edge is a communication link between two processes. This introductory survey presents a brief outline, several important concepts, and the fundamental complexity study of distributed graph algorithms. For a number of standard problems such as the shortest path and the coloring, we spotlight their inherent difficulties and challenges.

Content from these authors
© 2015 by the Graduate School of Information Sciences (GSIS), Tohoku University

This article is licensed under a Creative Commons [Attribution 4.0 International] license.
https://creativecommons.org/licenses/by/4.0/
Previous article Next article
feedback
Top