论文笔记(Dynamic Tree Cut Sparsifier)

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality

Brand, Jan van den, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg和Sushant Sachdeva. 《Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality》. arXiv, 2024年7月15日. https://doi.org/10.48550/arXiv.2407.10830.