An algorithm to increase the node-connectivity of a digraph by one

DOI10.1016/j.disopt.2008.03.002zbMath1170.05330OpenAlexW2106199941WikidataQ56987172 ScholiaQ56987172MaRDI QIDQ955325

László A. Végh, András Frank

Publication date: 19 November 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2008.03.002

zbMATH Keywords

graph algorithmsconnectivity augmentation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (3)

Making Bipartite Graphs DM-Irreducible ⋮ Jump Number of Two-Directional Orthogonal Ray Graphs ⋮ Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs

Cites Work

• Unnamed Item
• A minimax theorem on intervals
• Uncrossing a family of set-pairs
• Directed vertex-connectivity augmentation
• Finding minimum generators of path systems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Minimal edge-coverings of pairs of sets
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Augmentation Problems

This page was built for publication: An algorithm to increase the node-connectivity of a digraph by one