Deterministic mincut in almost-linear time

DOI10.1145/3406325.3451114arXiv2106.05513OpenAlexW3172876995MaRDI QIDQ6087010

Jason Li

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.05513

zbMATH Keywords

minimum cutdeterministic algorithmsde-randomizationgraph sparsification

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

An optimal pruned traversal tree-based fast minimum cut solver in dense graph

This page was built for publication: Deterministic mincut in almost-linear time