Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice

DOI10.4230/LIPICS.SEA.2021.20MaRDI QIDQ6159911zbMATH OpenOpenAlexFDO

Authors Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano

Publication date 23 June 2023

Full work available at URL https://hal.inria.fr/hal-03395500

zbMATH Keywords

2-connectivitygraph algorithmssplit components

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Computing the 4-edge-connected components of a graph: an experimental study

This page was built for publication: Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice

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