Structured Connectivity Augmentation

DOI10.1137/17M1146233zbMath1400.05134arXiv1706.04255MaRDI QIDQ4555048

Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos

Publication date: 19 November 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.04255

zbMATH Keywords

complexity; connectivity augmentation; graph superposition

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C40: Connectivity