17 citations · 17 across the 3 of their papers we have counts for
3 papers
cs.LG2023
A Gromov--Wasserstein Geometric View of Spectrum-Preserving Graph Coarsening
Yifan Chen, Rentian Yao, Yun Yang +1
Graph coarsening is a technique for solving large-scale graph problems by working on a smaller version of the original graph, and possibly interpolating the results back to the ori…
cs.DM2017★ 17 cited
Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning
Ruslan Shaydulin, Jie Chen, Ilya Safro
Multilevel partitioning methods that are inspired by principles of multiscaling are the most powerful practical hypergraph partitioning solvers. Hypergraph partitioning has many ap…
cs.DM2009
A Measure of the Connection Strengths between Graph Vertices with Applications
Jie Chen, Ilya Safro
We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and…