Graph Partitioning #19
Description
To improve compression rates, one idea is to improve node locality. See
If we renumber nodes based on their recursively-defined partition, we'd automatically improve node locality.
We could start out simple but solid with
- Inertial Flow for partitioning
- Dinic's algorithms for the max flow / min cut calculations
- O(n) based partial sorting, see nth element / introselect
Look into