Pages that link to "Item:Q5495033"
From MaRDI portal
The following pages link to A Nearly-m log n Time Solver for SDD Linear Systems (Q5495033):
Displayed 33 items.
- A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system (Q262960) (← links)
- Spectral sparsification in the semi-streaming setting (Q372976) (← links)
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data (Q1624673) (← links)
- Variational methods for normal integration (Q1636005) (← links)
- A queueing network-based distributed Laplacian solver (Q1979459) (← links)
- A spectral approach to the shortest path problem (Q2020688) (← links)
- On graph parameters guaranteeing fast sandpile diffusion (Q2260617) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Fitting a graph to one-dimensional data (Q2663044) (← links)
- Single Pass Spectral Sparsification in Dynamic Streams (Q2968162) (← links)
- Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time (Q4562276) (← links)
- Network Essence: PageRank Completion and Centrality-Conforming Markov Chains (Q4604398) (← links)
- Using Petal-Decompositions to Build a Low Stretch Spanning Tree (Q4629391) (← links)
- A New Approach to Laplacian Solvers and Flow Problems (Q4633047) (← links)
- An Adaptive Fast Solver for a General Class of Positive Definite Matrices Via Energy Decomposition (Q4643812) (← links)
- Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank (Q4985799) (← links)
- Graph Clustering using Effective Resistance (Q4993308) (← links)
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition (Q5002702) (← links)
- RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems (Q5021403) (← links)
- Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (Q5096446) (← links)
- A General Framework for Graph Sparsification (Q5232324) (← links)
- Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems (Q5270418) (← links)
- Solving Graph Laplacian Systems Through Recursive Partitioning and Two-Grid Preconditioning (Q5348222) (← links)
- Multi-way spectral partitioning and higher-order cheeger inequalities (Q5415539) (← links)
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis (Q5874469) (← links)
- Diffuse scattering on graphs (Q5965387) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
- Minimum cost flow in the CONGEST model (Q6148076) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)
- Hardness of graph-structured algebraic and symbolic problems (Q6179415) (← links)
- Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model (Q6202225) (← links)
- Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique (Q6202226) (← links)