How to make a strongly connected digraph two-connected

DOI10.1007/3-540-59408-6_69zbMath1501.05012OpenAlexW1548208024MaRDI QIDQ5101433

No author found.

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1414

zbMATH Keywords

combinatorial polynomial algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cites Work

• Unnamed Item
• Edge-connectivity augmentation problems
• A minimum 3-connectivity augmentation of a graph
• On the optimal vertex-connectivity augmentation
• Minimal edge-coverings of pairs of sets
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Augmentation Problems

This page was built for publication: How to make a strongly connected digraph two-connected