Computing the 3-edge-connected components of directed graphs in linear time

DOI10.1109/FOCS61266.2024.00015MaRDI QIDQ7286882zbMATH OpenFDO

Authors Loukas Georgiadis, Giuseppe F. Italiano

Publication date 23 June 2026

Full work available at URL https://doi.org/10.1109/FOCS61266.2024.00015

Mathematics Subject Classification ID

No records found.

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 3-edge-connected components of directed graphs in linear time

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