Modeling and Analyzing Graph Algorithms by Means of Graph Transformation Units

Abstract

Graph transformation units are rule-based devices to specify processes on graphs and the dynamics of information- processing systems with graphs as states. In this article, we propose graph transformation units as a framework to model graph algorithms, to prove their correctness and to analyze their complexity. A specific emphasis is laid on the improvement of the efficiency of graph algorithms by massive parallelism.

Keywords

graph algorithms, graph transformation units, massive parallelism.

Cite as:

Hans-Jörg Kreowski, Sabine Kuske, “Modeling and Analyzing Graph Algorithms by Means of Graph Transformation Units”, Journal of Object Technology, Volume 19, no. 3 (October 2020), pp. 3:1-14, doi:10.5381/jot.2020.19.3.a9.

This article is accompanied by a video realized by the author(s).