Jan van den Brand

activity

20172024

most citedBipartite Matching in Nearly-linear Time on Moderately Dense Graphs

12 citations · 36 across the 12 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

cs.DS2023

Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time

Jan van den Brand, Li Chen, Rasmus Kyng +5

We provide an algorithm which, with high probability, maintains a $(1 - ε)$ -approximate maximum flow on an undirected graph undergoing $m$ -edge additions in amortized $m^{o(1)} ε^{-3…

cs.DS2023★ 3 cited

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow

Jan van den Brand, Li Chen, Rasmus Kyng +5

We give a deterministic $m^{1 + o (1)}$ time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral dem…