3 papers
cs.PL2026
Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms
Ziad Ismaili Alaoui, Detlef Plump
We report on recent advances in rule-based graph programming, which allow us to match the time complexity of some fundamental imperative graph algorithms. In general, achieving the…
cs.PL2026
Implementing Binary Search Trees in GP 2 (Extended Abstract)
Ziad Ismaili Alaoui, Detlef Plump
We present an approach to implement binary search trees in the rule-based graph programming language GP 2. Our implementation uses GP 2's rooted graph transformation rules to be fa…
cs.PL2025
Linear-Time Graph Programs without Preconditions
Ziad Ismaili Alaoui, Detlef Plump
We report on a recent breakthrough in rule-based graph programming, which allows us to reach the time complexity of imperative linear-time algorithms. In general, achieving the com…