Parallel and fast sequential algorithms for undirected edge connectivity augmentation
From MaRDI portal
Publication:1300063
DOI10.1007/S101070050042zbMath0931.68078OpenAlexW2049057921MaRDI QIDQ1300063
Publication date: 7 February 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050042
Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (1)
This page was built for publication: Parallel and fast sequential algorithms for undirected edge connectivity augmentation
