Computing the 5-edge-connected components in linear time

DOI10.1137/1.9781611977912.76MaRDI QIDQ6645435zbMATH OpenFDO

Authors

Publication date 28 November 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• Higher connectivity in directed graphs (invited talk)
• Faster dynamic 2-edge connectivity in directed graphs
• A linear-delay algorithm for enumerating strongly-connected induced subgraphs based on SSD set system

This page was built for publication: Computing the 5-edge-connected components in linear time

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