That's really cool. These days similar strategies based on graph coarsening and vertex ordering are really popular for improving the sparsity pattern of preconditioners- e.g. incomplete lu decompositions for iterative linear solvers.

yeah, there's so much room to extend this work in terms of graph coarsening / sparsifying, especially for progressive / approximate approaches

there's lots of overlap with entropy binning as well and likely some sort of combo for win -- figure out "max frequency" with some sort of FFT / wavelet like meta technique or somehow bin edges based on entropy contribution, etc.

or, lots of pathways to make coontinuous / numerical in JPEG like way

basically JPEGs for graphs -- with big impacts in AI / ML computes

p.s. my user name from that work -- aghilmort is canonical alpha sort / scrabble sort of algorithm and logarithm