The complexity of mixed-connectivity

DOI10.1007/s10479-021-04330-7MaRDI QIDQ2070706

Sergio Cabello, Édouard Bonnet

Publication date: 24 January 2022

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

NP-completeness; edge-connectivity; vertex-connectivity; parameterized complexity; mixed-connectivity; mixed-cut

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

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

05C85: Graph algorithms (graph-theoretic aspects)

05C40: Connectivity