HyperSF: Spectral Hypergraph Coarsening via Flow-based Local Clustering

Hypergraphs allow modeling problems with multiway high-order relationships. However, the computational cost of most existing hypergraph-based algorithms can be heavily dependent upon the input hypergraph sizes. To address the ever-increasing computational challenges, graph coarsening can be potentially applied for preprocessing a given hypergraph by aggressively aggregating its vertices (nodes). H...