New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Graph Partitioning #19

Open

daniel-j-h opened this issue Jul 23, 2021 · 0 comments

Member

daniel-j-h commented Jul 23, 2021

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

daniel-j-h mentioned this issue

Reorder graph nodes to improve locality #17

Open

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment