A unifying augmentation algorithm for two-edge connectivity and biconnectivity
From MaRDI portal
Publication:1282207
DOI10.1023/A:1009746026508zbMath0916.90260MaRDI QIDQ1282207
Publication date: 21 July 1999
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
linear time algorithm; undirected graph; biconnectivity; bi-level augmentation problem; two-edge connectivity
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
Related Items