A simple deterministic algorithm for edge connectivity

DOI10.1137/1.9781611976496.9MaRDI QIDQ6538746zbMATH OpenFDO

Authors Thatchaphol Saranurak

Publication date 14 May 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• Space complexity of vertex connectivity oracles
• High-speed minimum cut approximation in dense graph using compacted pruned tree
• Worst-case to expander-case reductions: derandomized and generalized
• Practical expander decomposition

This page was built for publication: A simple deterministic algorithm for edge connectivity

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