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

DOI10.1016/J.DISOPT.2008.03.002MaRDI QIDQ955325zbMATH OpenOpenAlexDBLPWikidataFDO

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

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

connectivity augmentationgraph algorithms

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(3)

• Jump number of two-directional orthogonal ray graphs
• Making bipartite graphs DM-irreducible
• Supermodularity in unweighted graph optimization. III: Highly connected digraphs

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

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