I’d be interested in how these systems-based approaches compare in practice to more theoretical techniques like those discussed in CS 369Z: Dynamic Data Structures for Large Graphs. Many of these are not obviously parallelizablr but can lead to up to exponential (amortised) speed-ups.
I’d be interested in how these systems-based approaches compare in practice to more theoretical techniques like those discussed in CS 369Z: Dynamic Data Structures for Large Graphs. Many of these are not obviously parallelizablr but can lead to up to exponential (amortised) speed-ups.