Incrementing bipartite digraph edge-connectivity
From MaRDI portal
Publication:1592842
DOI10.1023/A:1009885511650zbMath0972.90084MaRDI QIDQ1592842
Publication date: 16 November 2001
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
rigidity; graph algorithms; connectivity augmentation; min-max theorems; crossing family; square grid framework
Related Items
Bipartition constrained edge-splitting in directed graphs, Augmenting the rigidity of a graph in \(\mathbb R^{2}\)