Reproduce “Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.