On the public citation graph

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow

https://doi.org/10.1145/3610940
0 signed · 50 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01580724openalex-snapshot
A polynomial-time algorithm, based on Newton's method, for linear programming
inferredcites →https://doi.org/10.1109/focs.2013.35openalex-snapshot
Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back
inferredcites →https://doi.org/10.1109/focs.2013.36openalex-snapshot
Nearly Maximum Flows in Nearly Linear Time
inferredcites →https://doi.org/10.1109/focs.2016.70openalex-snapshot
Computing Maximum Flow with Augmenting Electrical Flows
inferredcites →https://doi.org/10.1109/focs46700.2020.00018openalex-snapshot
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs
inferredcites →https://doi.org/10.1109/focs46700.2020.00020openalex-snapshot
Unit Capacity Maxflow in Almost Time
inferredcites →https://doi.org/10.1109/focs46700.2020.00090openalex-snapshot
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs
inferredcites →https://doi.org/10.1109/focs52979.2021.00058openalex-snapshot
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao
inferredcites →https://doi.org/10.1109/focs52979.2021.00059openalex-snapshot
Faster Sparse Minimum Cost Flow by Electrical Flow Localization
inferredcites →https://doi.org/10.1109/focs52979.2021.00100openalex-snapshot
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time
inferredcites →https://doi.org/10.1109/focs52979.2022openalex-snapshot
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
inferredcites →https://doi.org/10.1109/focs54457.2022.00063openalex-snapshot
Negative-Weight Single-Source Shortest Paths in Near-linear Time
inferredcites →https://doi.org/10.1109/focs54457.2022.00088openalex-snapshot
Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.1137/1.9781611974331openalex-snapshot
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
inferredcites →https://doi.org/10.1137/17m1115575openalex-snapshot
Using Petal-Decompositions to Build a Low Stretch Spanning Tree
inferredcites →https://doi.org/10.1137/s0097539792224474openalex-snapshot
A Graph-Theoretic Game and Its Application to the k -Server Problem
inferredcites →https://doi.org/10.1145/1007352.1007372openalex-snapshot
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
inferredcites →https://doi.org/10.1145/1374376.1374441openalex-snapshot
Faster approximate lossy generalized flow via interior point algorithms
inferredcites →https://doi.org/10.1145/1993636.1993674openalex-snapshot
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
inferredcites →https://doi.org/10.1145/290179.290181openalex-snapshot
Beyond the flow decomposition barrier
inferredcites →https://doi.org/10.1145/3055399.3055501openalex-snapshot
Area-convexity, l ∞ regularization, and undirected multicommodity flow
inferredcites →https://doi.org/10.1145/3313276.3316410openalex-snapshot
Flows in almost linear time via adaptive preconditioning
inferredcites →https://doi.org/10.1145/3357713.3384247openalex-snapshot
Faster energy maximization for faster maximum flow
inferredcites →https://doi.org/10.1145/3357713.3384309openalex-snapshot
Solving tall dense linear programs in nearly linear time
inferredcites →https://doi.org/10.1145/3406325.3451088openalex-snapshot
Vertex connectivity in poly-logarithmic max-flows
inferredcites →https://doi.org/10.1145/3406325.3451112openalex-snapshot
Approximate Gomory–Hu tree is faster than n – 1 max-flows
inferredcites →https://doi.org/10.1145/3519935.3520068openalex-snapshot
Faster maxflow via improved dynamic spectral vertex sparsifiers
inferredcites →https://doi.org/10.1145/800057.808695openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1287/moor.15.3.430openalex-snapshot
Finding Minimum-Cost Circulations by Successive Approximation
inferredcites →https://doi.org/10.5555/2634074.2634090openalex-snapshot
An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4785888openalex-extracted
Computation of Lower Tolerances of Combinatorial Bottleneck Problems
inferred← citeshttps://doi.org/10.2139/ssrn.4877057openalex-extracted
Destroying Densest Subgraphs is Hard
inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_18openalex-snapshot
Packing Dimers to Maximum Occupancy Under Soft-Core Constraints
inferred← citeshttps://doi.org/10.1007/s00224-025-10240-zopenalex-snapshot
On Strings Having the Same Length-k Substrings
inferred← citeshttps://doi.org/10.1007/s00453-025-01350-8openalex-snapshot
Recognition Complexity of Subgraphs of $${\textbf {k}}$$-Connected Planar Cubic Graphs
inferred← citeshttps://doi.org/10.1007/s00454-026-00864-4openalex-snapshot
Tropical Fermat–Weber Polytropes
inferred← citeshttps://doi.org/10.1016/j.disopt.2025.100887openalex-snapshot
Computation of lower tolerances of combinatorial bottleneck problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103635openalex-snapshot
Destroying Densest Subgraphs is Hard
inferred← citeshttps://doi.org/10.1109/icfact66887.2026.11518194openalex-snapshot
Multipath Flow Routing For Battery Life Enhancement in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icns65417.2025.10976879openalex-snapshot
A Digital-Twin Based Airspace Corridor Design and Dynamic Configuration for High-density UAS Traffic Management
inferred← citeshttps://doi.org/10.1109/iv66570.2026.11623849openalex-snapshot
Taming Perception Jitter: Uncertainty-Aware LiDAR Object Detection for Reliable Motion Classification
inferred← citeshttps://doi.org/10.1109/tgcn.2025.3642779openalex-snapshot
Energy-Efficient Flexible Functional Splitting in Latency-Constrained O-RAN
inferred← citeshttps://doi.org/10.1145/3694906.3743305openalex-snapshot
Parallel Batch Queries on Dynamic Trees: Algorithms and Experiments
inferred← citeshttps://doi.org/10.1145/3717823.3718267openalex-snapshot
Accelerated Approximate Optimization of Multi-commodity Flows on Directed Graphs
inferred← citeshttps://doi.org/10.2139/ssrn.5432742openalex-snapshot
The Strong Core of Housing Markets with Partial Order Preferences
inferred← citeshttps://doi.org/10.23919/comex.2025xbl0056openalex-snapshot
An Implementation of Routing in Wireless Mesh Networks Using the Maximum Flow Problem
inferred← citeshttps://doi.org/10.3390/e27080847openalex-snapshot
The Synergistic Effects of Structural Evolution and Attack Strategies on Network Matching Robustness
inferred← citeshttps://doi.org/10.46298/theoretics.24.26openalex-snapshot
An Enumerative Perspective on Connectivity
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.