Modeling and AnalyzingGraph Algorithms by Means ofGraph Transformation Units

摘要

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.