Deterministic edge connectivity and max flow using subquadratic cut queries

DOI10.1137/1.9781611978322.4MaRDI QIDQ7289559zbMATH OpenFDO

Authors Aditya Anand, Thatchaphol Saranurak, Yunfan Wang

Publication date 3 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978322.4

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Cut-query algorithms with few rounds

This page was built for publication: Deterministic edge connectivity and max flow using subquadratic cut queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289559)