Optimal electrical oblivious routing on expanders
From MaRDI portal
Cites work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- A Scheme for Fast Parallel Communication
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- An almost-linear time algorithm for uniform random spanning tree generation
- Approximate Gaussian elimination for Laplacians -- fast, sparse, and simple
- Approximate undirected maximum flows in \(O(m\operatorname{polylog}(n))\) time
- Computing cut-based hierarchical decompositions in almost linear time
- Electric routing and concurrent flow cutting
- Fast approximation algorithms for cut-based problems in undirected graphs
- Faster parallel algorithm for approximate shortest path
- Flows in almost linear time via adaptive preconditioning
- Generalized preconditioning and undirected minimum-cost flow
- High-girth near-Ramanujan graphs with localized eigenvectors
- Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality
- Hop-constrained oblivious routing
- scientific article; zbMATH DE number 5485537 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 3367521 (Why is no real title available?)
- scientific article; zbMATH DE number 7788371 (Why is no real title available?)
- scientific article; zbMATH DE number 7788470 (Why is no real title available?)
- Localization of electrical flows
- Maximum flow and minimum-cost flow in almost-linear time
- Mixing times and \(\ell_p\) bounds for oblivious routing
- Nearly maximum flows in nearly linear time
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Oblivious Routing for the Lp-norm
- On-line routing in all-optical networks
- Optimal oblivious routing in polynomial time
- Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
- Spectral subspace sparsification
- Undirected (1+ 𝜀 )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms
- Universally-optimal distributed shortest paths and transshipment via graph-based _1-oblivious routing
This page was built for publication: Optimal electrical oblivious routing on expanders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875133)
