The following pages link to (Q3549731):
Displaying 15 items.
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence (Q2149565) (← links)
- Polynomial-time algorithms for submodular Laplacian systems (Q2235770) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- A Simple Efficient Interior Point Method for Min-Cost Flow (Q2942676) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- Unit Capacity Maxflow in Almost $m^{4/3}$ Time (Q5071088) (← links)
- Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
- Hardness Results for Structured Linear Systems (Q5117379) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, <i>b</i>-matching, and Unweighted <i>f</i>-factors (Q5858644) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems (Q6139374) (← links)
