3 citations · 7 across the 17 of their papers we have counts for
1 paper · 1 filter
Florian Grötschla, Joël Mathys, Christoffer Raun +1
Many graph algorithms can be viewed as sets of rules that are iteratively applied, with the number of iterations dependent on the size and complexity of the input graph. Existing m…