5 citations · 7 across the 5 of their papers we have counts for
1 paper · 2 filters
Florian Grötschla, Joël Mathys, Roger Wattenhofer
Classical graph algorithms work well for combinatorial problems that can be thoroughly formalized and abstracted. Once the algorithm is derived, it generalizes to instances of any…