A queueing network-based distributed Laplacian solver
From MaRDI portal
Publication:1979459
DOI10.1007/S00453-021-00845-4OpenAlexW3176747354MaRDI QIDQ1979459FDOQ1979459
Authors: Iqra Altaf Gillani, Amitabha Bagchi 
Publication date: 2 September 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00845-4
Recommendations
Cites Work
- Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Probability Inequalities for Sums of Bounded Random Variables
- Fundamentals of queueing theory
- A linear work, \(O(n^{1/6})\) time, parallel algorithm for solving planar Laplacians
- Distributed Computing: A Locality-Sensitive Approach
- Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
- A Nearly-m log n Time Solver for SDD Linear Systems
- Graph sparsification by effective resistances
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- Title not available (Why is that?)
- Geometric Convergence Rates for Stochastically Ordered Markov Chains
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Stability of token passing rings
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
- An efficient multigrid method for graph Laplacian systems. II: Robust aggregation
- Title not available (Why is that?)
- An almost-linear time algorithm for uniform random spanning tree generation
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- Solving local linear systems with boundary conditions using heat kernel pagerank
- Lx = b
- A new approach to Laplacian solvers and flow problems
- Faster Generation of Random Spanning Trees
- An empirical comparison of graph Laplacian solvers
- An efficient parallel solver for SDD linear systems
- A queueing network-based distributed Laplacian solver for directed graphs
- Sampling random spanning trees faster than matrix multiplication
- Fast generation of random spanning trees and the effective resistance metric
Cited In (5)
- A queueing network-based distributed Laplacian solver for directed graphs
- A stochastic process on a network with connections to Laplacian systems of equations
- A new approach to Laplacian solvers and flow problems
- Title not available (Why is that?)
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts
Uses Software
This page was built for publication: A queueing network-based distributed Laplacian solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979459)
