Primal-dual approach for directed vertex connectivity augmentation and generalizations

DOI10.1145/1361192.1361197zbMath1446.68124OpenAlexW2165498664MaRDI QIDQ4962713

András A. Benczúr, László A. Végh

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1361192.1361197

zbMATH Keywords

combinatorial algorithmvertex connectivity augmentation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Connectivity (05C40)

Related Items (6)

Complexity of (arc)-connectivity problems involving arc-reversals or deorientations ⋮ Making Bipartite Graphs DM-Irreducible ⋮ Independent sets and hitting sets of bicolored rectangular families ⋮ Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings ⋮ Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation ⋮ Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs

This page was built for publication: Primal-dual approach for directed vertex connectivity augmentation and generalizations