Pages that link to "Item:Q5419097"

The following pages link to Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (Q5419097):

Displaying 35 items.

• Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
• Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
• Engineering a combinatorial Laplacian solver: lessons learned (Q1736844) (← links)
• A queueing network-based distributed Laplacian solver (Q1979459) (← links)
• Lower bounds for in-network computation of arbitrary functions (Q1981801) (← links)
• A Laplacian approach to \(\ell_1\)-norm minimization (Q2044482) (← links)
• Electrical flows over spanning trees (Q2097649) (← links)
• A polynomial algorithm for deciding the validity of an electrical distribution tree (Q2122795) (← links)
• Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
• A queueing network-based distributed Laplacian solver for directed graphs (Q2224851) (← links)
• Optimisation of electrical network configuration: complexity and algorithms for ring topologies (Q2227500) (← links)
• On graph parameters guaranteeing fast sandpile diffusion (Q2260617) (← links)
• Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
• Efficient sub-5 approximations for minimum dominating sets in unit disk graphs (Q2453164) (← links)
• Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
• On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
• Quadratically Regularized Optimal Transport on Graphs (Q3174762) (← links)
• Efficient Convex Optimization with Oracles (Q3295271) (← links)
• Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
• Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
• Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
• Graph Clustering using Effective Resistance (Q4993308) (← links)
• (Q5009600) (← links)
• Unit Capacity Maxflow in Almost $m^{4/3}$ Time (Q5071088) (← links)
• TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration (Q5090297) (← links)
• A Spectral Approach to Network Design (Q5092510) (← links)
• Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (Q5096446) (← links)
• (Q5111734) (← links)
• Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals (Q5214272) (← links)
• Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs (Q5252687) (← links)
• Numerical Methods for Gremban's Expansion of Signed Graphs (Q5372661) (← links)
• A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6066766) (← links)
• Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
• Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies (Q6497049) (← links)