Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
graph sparsification
Description:
A method for reducing a graph’s edges while approximately preserving selected structural or algorithmic properties.
Primary topic:
Complexity and Algorithms in Graphs (41%)
Related topics:
Complexity and Algorithms in Graphs (41%),
Advanced Graph Neural Networks (10%)
OpenAlex ID:
keywords/graph-sparsification
Sketching as a Tool for Numerical Linear Algebra
2014
·
David P. Woodruff
·
Foundations and Trends® in Theoretical Computer Science
·
1,475
PDF
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
2004
·
Daniel A. Spielman
, Shang-Hua Teng
·
ACM Symposium on Theory of Computing (STOC)
·
1,076
PDF
Graph Sparsification by Effective Resistances
2011
·
Daniel A. Spielman
, Nikhil Srivastava
·
SIAM Journal on Computing
·
804
PDF
Spectral Sparsification of Graphs
2011
·
Daniel A. Spielman
, Shang-Hua Teng
·
SIAM Journal on Computing
·
684
PDF
Approximating s-t minimum cuts in Õ ( n 2 ) time
1996
·
András A. Benczúr
, David R. Karger
·
ACM Symposium on Theory of Computing (STOC)
·
456
Graph sparsification by effective resistances
2008
·
Daniel A. Spielman
, Nikhil Srivastava
·
ACM Symposium on Theory of Computing (STOC)
·
434
Graph construction and b -matching for semi-supervised learning
2009
·
Tony Jebara
, Jun Wang
, et al.
·
International Conference on Machine Learning
·
404
Learning Actor Relation Graphs for Group Activity Recognition
2019
·
Jianchao Wu
, Limin Wang
, et al.
·
IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings
·
367
PDF
Learning to Drop: Robust Graph Neural Network via Topological Denoising
2021
·
Dongsheng Luo
, Wei Cheng
, et al.
·
ACM International Conference on Web Search and Data Mining (WSDM)
·
366
PDF
All pairs almost shortest paths
2000
·
D. Dor
, S. Halperin
, et al.
·
SIAM Journal on Computing
·
337
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
2013
·
Jonathan A. Kelner
, Yin Tat Lee
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
320
PDF
A Nearly-m log n Time Solver for SDD Linear Systems
2011
·
Ioannis Koutis
, Gary L. Miller
, et al.
·
Annual Symposium on Foundations of Computer Science
·
280
PDF
Solving SDD linear systems in nearly m log 1/2 n time
2014
·
Michael B. Cohen
, Rasmus Kyng
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
261
Spectral sparsification of graphs: theory and algorithms
2013
·
Joshua Batson
, Daniel A. Spielman
, et al.
·
Communications of the ACM
·
259
Approaching Optimality for Solving SDD Linear Systems
2010
·
Ioannis Koutis
, Gary L. Miller
, et al.
·
Annual Symposium on Foundations of Computer Science
·
256
Local graph sparsification for scalable clustering
2011
·
Venu Satuluri
, Srinivasan Parthasarathy
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
229
Decreasing the spectral radius of a graph by link removals
2011
·
Piet Van Mieghem
, Dragan Stevanović
, et al.
·
Physical Review E
·
223
PDF
Analyzing graph structure via linear measurements
2012
·
Kook Jin Ahn
, Sudipto Guha
, et al.
·
ScholarlyCommons (University of Pennsylvania)
·
221
PDF
A Survey and Taxonomy of Graph Sampling
2013
·
Hu, Pili
, Lau, Wing Cheong
·
arXiv (Cornell University)
·
206
PDF
Spanners and emulators with sublinear distance errors
2006
·
Mikkel Thorup
, Uri Zwick
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
175
Approaching Optimality for Solving SDD Linear Systems
2014
·
Ioannis Koutis
, Gary L. Miller
, et al.
·
SIAM Journal on Computing
·
173
PDF
A Unified Lottery Ticket Hypothesis for Graph Neural Networks
2021
·
Chen, Tianlong
, Sui, Yongduo
, et al.
·
arXiv (Cornell University)
·
172
PDF
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
2015
·
András A. Benczúr
, David R. Karger
·
SIAM Journal on Computing
·
170
PDF
Approximating the Minimum Spanning Tree Weight in Sublinear Time
2005
·
Bernard Chazelle
, Ronitt Rubinfeld
, et al.
·
SIAM Journal on Computing
·
170
Expander Decomposition and Pruning: Faster, Stronger, and Simpler
2019
·
Thatchaphol Saranurak
, Di Wang
·
Society for Industrial and Applied Mathematics eBooks
·
168
PDF
Show more works
View as search
Works count:
1,230
Citation count:
23,100
Year
Topic
Type