An Efficient Algorithm for All-Pairs Bounded Edge Connectivity

DOI10.1007/S00453-023-01203-2MaRDI QIDQ6492091zbMATH OpenFDO

Authors Shyan S. Akmal, Ce Jin

Publication date 24 April 2024

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00453-023-01203-2

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Cites work

• All-pairs 2-reachability in \(\mathcal{O}(n^\omega\log n)\) time
• Conditional Lower Bounds for All-Pairs Max-Flow
• Efficient algorithm for computing all low s-t edge connectivities in directed graphs
• Fast matrix rank algorithms and applications
• Faster algorithms for all-pairs bounded min-cuts
• Graph connectivities, network coding, and expander graphs
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor

Cited in

(1)

• An enumerative perspective on connectivity

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 Q6492091)