Interdisciplinary Information Sciences
Online ISSN : 1347-6157
Print ISSN : 1340-9050
ISSN-L : 1340-9050

この記事には本公開記事があります。本公開記事を参照してください。
引用する場合も本公開記事を引用してください。

Distributed Graph Algorithms and their Complexity: An Introduction
Taisuke IZUMI
著者情報
ジャーナル フリー 早期公開

論文ID: 2015.L.04

この記事には本公開記事があります。
詳細
抄録
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.
著者関連情報
© 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/
feedback
Top