5 citations · 8 across the 4 of their papers we have counts for
1 paper · 1 filter
Jonathan Kliem, Christian Stump
We discuss a new memory-efficient depth-first algorithm and its implementation that iterates over all elements of a finite locally branched lattice. This algorithm can be applied t…