Algorithms: Sequential, Parallel, And Distributed

by Sabri Pllana (Editor), Fatos Xhafa (Editor)

This book constitutes the thoroughly refereed post-conference proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009, held in Montpellier, France, in June 2009.
The 28 revised full papers presented together with two invited papers were carefully reviewed and selected from 69 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations.

Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities – such as processes, peers, processors, nodes, or agents – that individually have only a partial knowledge of the many input parameters associated with the problem.

Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities – such as processes, peers, processors, nodes, or agents – that individually have only a partial knowledge of the many input parameters associated with the problem.