Edge-connectivity augmentation problems
From MaRDI portal
Publication:1091147
DOI10.1016/0022-0000(87)90038-9zbMath0622.68057MaRDI QIDQ1091147
Publication date: 1987
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(87)90038-9
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C40: Connectivity
Related Items
A minimum 3-connectivity augmentation of a graph, Triangulating planar graphs while minimizing the maximum degree, A smallest augmentation to 3-connect a graph