Cactus representation of minimum cuts: derandomize and speed up

DOI10.1137/1.9781611977912.61MaRDI QIDQ6645417zbMATH OpenFDO

Authors Zhongtian He, Shang-En Huang, Thatchaphol Saranurak

Publication date 28 November 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• Protecting the connectivity of a graph under non-uniform edge failures
• Protecting the connectivity of a graph under nonuniform edge failures
• Efficient contractions of dynamic graphs -- with applications

This page was built for publication: Cactus representation of minimum cuts: derandomize and speed up

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