1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.PL2021
Fast Rule-Based Graph Programs
Graham Campbell, Brian Courtehoute, Detlef Plump
Implementing graph algorithms efficiently in a rule-based language is challenging because graph pattern matching is expensive. In this paper, we present a number of linear-time imp…
cs.PL2020★ 1 cited
A Fast Graph Program for Computing Minimum Spanning Trees
Brian Courtehoute, Detlef Plump
When using graph transformation rules to implement graph algorithms, a challenge is to match the efficiency of programs in conventional languages. To help overcome that challenge,…