Incrementing bipartite digraph edge-connectivity

DOI10.1023/A:1009885511650zbMath0972.90084OpenAlexW1506988604MaRDI QIDQ1592842

Tibor Jordán, Harold N. Gabow

Publication date: 16 November 2001

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009885511650

zbMATH Keywords

rigiditygraph algorithmsconnectivity augmentationmin-max theoremscrossing familysquare grid framework

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (3)

Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Augmenting the rigidity of a graph in \(\mathbb R^{2}\) ⋮ Bipartition constrained edge-splitting in directed graphs

This page was built for publication: Incrementing bipartite digraph edge-connectivity