Fully dynamic exact edge connectivity in sublinear time

DOI10.1137/1.9781611977554.CH3MaRDI QIDQ6538528zbMATH OpenFDO

Authors Gramoz Goranci, Monika R. Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen

Publication date 14 May 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• Stable and dynamic minimum cuts
• On the streaming complexity of expander decomposition
• Tree-packing revisited: faster fully dynamic min-cut and arboricity

This page was built for publication: Fully dynamic exact edge connectivity in sublinear time

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