Better sparsifiers for directed Eulerian graphs
From MaRDI portal
Cites work
- A framework for analyzing resparsification algorithms
- A matrix hyperbolic cosine algorithm and applications
- A new framework for matrix discrepancy: partial coloring bounds via mirror descent
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
- An efficient parallel solver for SDD linear systems
- An SDP-based algorithm for linear-sized spectral sparsification
- Approximate Gaussian elimination for Laplacians -- fast, sparse, and simple
- Constructing linear-sized spectral sparsification in almost-linear time
- Derandomizing directed random walks in almost-linear time
- Determinant-preserving sparsification of SDDM matrices with applications to counting and sampling spanning trees
- Deterministic discrepancy minimization via the multiplicative weight update method
- Efficient $\widetilde{O}(n/\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse
- Expander decomposition and pruning: faster, stronger, and simpler
- Faster algorithms for computing the stationary distribution, simulating random walks, and more
- Graph sparsification by effective resistances
- Graph sparsification, spectral sketches, and faster resistance computation, via short cycle decompositions
- scientific article; zbMATH DE number 1256718 (Why is no real title available?)
- scientific article; zbMATH DE number 5485569 (Why is no real title available?)
- Improved spectral sparsification and numerical algorithms for SDD matrices
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Kirchhoff index as a measure of edge centrality in weighted networks: nearly linear time algorithms
- Linear Size Sparsifier and the Geometry of the Operator Norm Ball
- Linear-sized sparsifiers via near-linear time discrepancy theory
- Matrix discrepancy from Quantum communication
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- On sketching quadratic forms
- Optimal short cycle decomposition in almost linear time
- Perron-Frobenius theory in nearly linear time: positive eigenvectors, M-matrices, graph kernels, and other applications
- Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank
- Roth's estimate of the discrepancy of integer sequences is nearly sharp
- Sampling random spanning trees faster than matrix multiplication
- Short cycles via low-diameter decompositions
- Singular value approximation and sparsifying random walks on directed graphs
- Solving directed Laplacian systems in nearly-linear time through sparse LU factorizations
- Sparsified block elimination for directed laplacians
- Sparsified Cholesky and multigrid solvers for connection Laplacians
- Spectral sparsification and regret minimization beyond matrix multiplicative updates
- Spectral sparsification of graphs
- Spectral sparsification via random spanners
- Twice-Ramanujan sparsifiers
- Twice-Ramanujan sparsifiers
- User-friendly tail bounds for sums of random matrices
- Vector balancing in Lebesgue spaces
This page was built for publication: Better sparsifiers for directed Eulerian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875068)
