A queueing network-based distributed Laplacian solver
type: Item
instance of: scholarly article
title: A queueing network-based distributed Laplacian solver
author: Iqra Altaf Gillani
author: Amitabha Bagchi
published in: Algorithmica
publication date: 2021-09-02T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 05C81
Mathematics Subject Classification ID: 05C21
zbMATH DE Number: 7390204
zbMATH Keywords: Laplacian solver
zbMATH Keywords: distributed algorithm
zbMATH Keywords: queueing networks
zbMATH Keywords: random walks
zbMATH Keywords: random spanning trees
describes a project that uses: Laplacians.jl
describes a project that uses: LAMG
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: s00453-021-00845-4
OpenAlex ID: W3176747354
cites work: The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
cites work: Q5090373
cites work: Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
cites work: An Empirical Comparison of Graph Laplacian Solvers
cites work: Q3546603
cites work: Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
cites work: Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank
cites work: Solving SDD linear systems in nearly m log 1/2 n time
cites work: Sampling random spanning trees faster than matrix multiplication
cites work: Stability of token passing rings
cites work: A queueing network-based distributed Laplacian solver for directed graphs
cites work: Q3511006
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Faster Generation of Random Spanning Trees
cites work: A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
cites work: Q2934693
cites work: A Nearly-m log n Time Solver for SDD Linear Systems
cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
cites work: Q3549475
cites work: Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
cites work: Geometric Convergence Rates for Stochastically Ordered Markov Chains
cites work: Fast Generation of Random Spanning Trees and the Effective Resistance Metric
cites work: An Efficient Multigrid Method for Graph Laplacian Systems II: Robust Aggregation
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: An efficient parallel solver for SDD linear systems
cites work: A New Approach to Laplacian Solvers and Flow Problems
cites work: An almost-linear time algorithm for uniform random spanning tree generation
cites work: Graph Sparsification by Effective Resistances
cites work: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
cites work: Lx = b
DOI: 10.1007/S00453-021-00845-4
description: scientific article; zbMATH DE number 7390204