Directed vertex-connectivity augmentation

DOI10.1007/s101070050038zbMath0934.05081OpenAlexW2148988287MaRDI QIDQ1300059

András Frank, Tibor Jordán

Publication date: 10 April 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050038

zbMATH Keywords

digraphcombinatorial algorithmvertex-connectivity

Mathematics Subject Classification ID

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

Related Items (8)

Making a tournament k $k$‐strong ⋮ An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach ⋮ Testing Eulerianity and connectivity in directed sparse graphs ⋮ Strongly connectable digraphs and non-transitive dice ⋮ Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs ⋮ An algorithm to increase the node-connectivity of a digraph by one ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ Tournaments and Semicomplete Digraphs

This page was built for publication: Directed vertex-connectivity augmentation