Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bernstein, Aaron, Blikstad, Joakim, Saranurak, Thatchaphol, Tu, Ta-Wei
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2406.03648