An Efficient Algorithm for All-Pairs Bounded Edge Connectivity

DOI10.1007/S00453-023-01203-2MaRDI QIDQ6492091FDOQ6492091

Shyan S. Akmal, Ce Jin

Publication date: 24 April 2024

Published in: Algorithmica (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Fast matrix rank algorithms and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph connectivities, network coding, and expander graphs
• Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs
• Conditional Lower Bounds for All-Pairs Max-Flow
• All-Pairs 2-Reachability in O(n^w log n) Time

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)