A Framework for Analyzing Resparsification Algorithms
暂无分享,去创建一个
Jakub W. Pachocki | Richard Peng | Sushant Sachdeva | Rasmus Kyng | Richard Peng | Sushant Sachdeva | Rasmus Kyng | J. Pachocki
[1] Nikhil Srivastava,et al. Graph Sparsification by Effective Resistances , 2011, SIAM J. Comput..
[2] Ioannis Koutis. Simple parallel and distributed algorithms for spectral graph sparsification , 2014, SPAA.
[3] Shang-Hua Teng,et al. Spectral Sparsification of Graphs , 2008, SIAM J. Comput..
[4] Jakub W. Pachocki,et al. Solving SDD linear systems in nearly mlog1/2n time , 2014, STOC.
[5] Richard Peng,et al. On Fully Dynamic Graph Sparsifiers , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[6] Jakub W. Pachocki,et al. Constant Arboricity Spectral Sparsifiers , 2018, ArXiv.
[7] Joseph JáJá,et al. An Introduction to Parallel Algorithms , 1992 .
[8] David R. Karger,et al. Fast Augmenting Paths by Random Sampling from Residual Graphs , 2015, SIAM J. Comput..
[9] Sushant Sachdeva,et al. Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[10] He Sun,et al. Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time , 2017 .
[11] Gary L. Miller,et al. A Nearly-m log n Time Solver for SDD Linear Systems , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[12] Richard Szeliski,et al. Efficient preconditioning of laplacian matrices for computer graphics , 2013, ACM Trans. Graph..
[13] S. Sitharama Iyengar,et al. Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.
[14] Jakub W. Pachocki,et al. Online Row Sampling , 2016, APPROX-RANDOM.
[15] David P. Woodruff,et al. On Sketching Quadratic Forms , 2015, ITCS.
[16] Anup Rao,et al. Fast, Provable Algorithms for Isotonic Regression in all L_p-norms , 2015, NIPS.
[17] He Sun. Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time , 2017 .
[18] David R. Karger,et al. Approximating s-t minimum cuts in Õ(n2) time , 1996, STOC '96.
[19] Aleksander Madry,et al. Faster Generation of Random Spanning Trees , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[20] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[21] Nikhil Srivastava,et al. Twice-ramanujan sparsifiers , 2008, STOC '09.
[22] Debmalya Panigrahi,et al. A general framework for graph sparsification , 2010, STOC '11.
[23] Richard Peng,et al. Algorithm Design Using Spectral Graph Theory , 2013 .
[24] Debmalya Panigrahi,et al. A Linear-time Algorithm for Sparsification of Unweighted Graphs , 2010, ArXiv.
[25] Gary L. Miller,et al. Parallel graph decompositions using random shifts , 2013, SPAA.
[26] Gorav Jindal,et al. Faster Spectral Sparsification of Laplacian and SDDM Matrix Polynomials , 2015, ArXiv.
[27] Nisheeth K. Vishnoi,et al. Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition , 2010, SODA '11.
[28] J. Tropp. FREEDMAN'S INEQUALITY FOR MATRIX MARTINGALES , 2011, 1101.3039.
[29] Nisheeth K. Vishnoi,et al. Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator , 2011, STOC '12.
[30] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[31] Rina Panigrahy,et al. Spectral sparsification via random spanners , 2012, ITCS '12.
[32] Jonathan A. Kelner,et al. Spectral Sparsification in the Semi-streaming Setting , 2012, Theory of Computing Systems.
[33] Shang-Hua Teng,et al. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.
[34] Satish Rao,et al. Graph partitioning using single commodity flows , 2009, JACM.
[35] Gary L. Miller,et al. Improved Parallel Algorithms for Spanners and Hopsets , 2015, SPAA.
[36] Sudipto Guha,et al. Graph Sparsification in the Semi-streaming Model , 2009, ICALP.
[37] Ioannis Koutis,et al. Spanning Edge Centrality: Large-scale Computation and Applications , 2015, WWW.
[38] Gary L. Miller,et al. Faster approximate multicommodity flow using quadratically coupled flows , 2012, STOC '12.
[39] Yu Cheng,et al. Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification , 2015, COLT.
[40] Richard Peng,et al. Sparsified Cholesky and multigrid solvers for connection laplacians , 2015, STOC.
[41] Richard Peng,et al. Faster Spectral Sparsification and Numerical Algorithms for SDD Matrices , 2012, ACM Trans. Algorithms.
[42] Ilya Safro,et al. Single- and Multi-level Network Sparsification by Algebraic Distance , 2016, J. Complex Networks.
[43] Joan Feigenbaum,et al. On graph problems in a semi-streaming model , 2005, Theor. Comput. Sci..