14 citations · 42 across the 8 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020★ 6 cited
SF-GRASS: Solver-Free Graph Spectral Sparsification
Ying Zhang, Zhiqiang Zhao, Zhuo Feng
Recent spectral graph sparsification techniques have shown promising performance in accelerating many numerical and graph algorithms, such as iterative methods for solving large sp…
cs.DS2018★ 11 cited
Nearly-Linear Time Spectral Graph Reduction for Scalable Graph Partitioning and Data Visualization
Zhiqiang Zhao, Yongyu Wang, Zhuo Feng
This paper proposes a scalable algorithmic framework for spectral reduction of large undirected graphs. The proposed method allows computing much smaller graphs while preserving th…
cs.DS2018★ 1 cited
A Unified Approach to Scalable Spectral Sparsification of Directed Graphs
Ying Zhang, Zhiqiang Zhao, Zhuo Feng
Recent spectral graph sparsification research allows constructing nearly-linear-sized subgraphs that can well preserve the spectral (structural) properties of the original graph, s…