An efficient algorithm for all-pairs bounded edge connectivity

DOI10.4230/LIPICS.ICALP.2023.11MaRDI QIDQ6638002zbMATH OpenFDO

Authors Shyan S. Akmal, Ce Jin

Publication date 14 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2023.11

zbMATH Keywords

all-pairsconnectivitymatrix rankmaximum flow

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: An efficient algorithm for all-pairs bounded edge connectivity

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