Pages that link to "Item:Q4977989"
From MaRDI portal
The following pages link to Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs (Q4977989):
Displaying 11 items.
- A queueing network-based distributed Laplacian solver for directed graphs (Q2224851) (← links)
- Polynomial-time algorithms for submodular Laplacian systems (Q2235770) (← links)
- Spectral complexity of directed graphs and application to structural decomposition (Q2424711) (← links)
- Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms (Q2941566) (← links)
- Directed forests with application to algorithms related to Markov chains (Q4522978) (← links)
- Efficient numerical methods to solve sparse linear equations with application to PageRank (Q5043846) (← links)
- Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (Q5096446) (← links)
- Determinant-Preserving Sparsification of SDDM Matrices (Q5117381) (← links)
- (Q5158498) (← links)
- (Q5875498) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)