## Abstract

In the Vertex Connectivity Survivable Network Design (VC-SNDP) problem, the input is a graph G and a function d : V (G) × V (G) → N that encodes the vertex-connectivity demands between pairs of vertices. The objective is to find the smallest subgraph H of G that satisfies all these demands. It is a well-studied NP-complete problem that generalizes several network design problems. We consider the case of uniform demands, where for every vertex pair (u, v) the connectivity demand d(u, v) is a fixed integer κ. It is an important problem with wide applications. We study this problem in the realm of Parameterized Complexity. In this setting, in addition to G and d we are given an integer ℓ as the parameter and the objective is to determine if we can remove at least ℓ edges from G without violating any connectivity constraints. This was posed as an open problem by Bang-Jansen et.al. [SODA 2018], who studied the edge-connectivity variant of the problem under the same settings. Using a powerful classification result of Lokshtanov et al. [ICALP 2018], Gutin et al. [JCSS 2019] recently showed that this problem admits a (non-uniform) FPT algorithm where the running time was unspecified. Further they also gave an (uniform) FPT algorithm for the case of κ = 2. In this paper we present a (uniform) FPT algorithm any κ that runs in time 2^{O}(^{κ2ℓ4 log} ℓ^{)} · |V (G)|^{O(1)}. Our algorithm is built upon new insights on vertex connectivity in graphs. Our main conceptual contribution is a novel graph decomposition called the Wheel decomposition. Informally, it is a partition of the edge set of a graph G, E(G) = X_{1} ∪ X_{2} . . . ∪ X_{r}, with the parts arranged in a cyclic order, such that each vertex v ∈ V (G) either has edges in at most two consecutive parts, or has edges in every part of this partition. The first kind of vertices can be thought of as the rim of the wheel, while the second kind form the hub. Additionally, the vertex cuts induced by these edge-sets in G have highly symmetric properties. Our main technical result, informally speaking, establishes that “nearly edge-minimal” κ-vertex connected graphs admit a wheel decomposition – a fact that can be exploited for designing algorithms. We believe that this decomposition is of independent interest and it could be a useful tool in resolving other open problems.

Originalsprog | Engelsk |
---|---|

Titel | 31st Annual European Symposium on Algorithms, ESA 2023 |

Redaktører | Inge Li Gortz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman |

Antal sider | 15 |

Forlag | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |

Publikationsdato | sep. 2023 |

Artikelnummer | 13 |

ISBN (Elektronisk) | 9783959772952 |

DOI | |

Status | Udgivet - sep. 2023 |

Begivenhed | 31st Annual European Symposium on Algorithms, ESA 2023 - Amsterdam, Holland Varighed: 4. sep. 2023 → 6. sep. 2023 |

### Konference

Konference | 31st Annual European Symposium on Algorithms, ESA 2023 |
---|---|

Land/Område | Holland |

By | Amsterdam |

Periode | 04/09/2023 → 06/09/2023 |

Navn | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|

Vol/bind | 274 |

ISSN | 1868-8969 |

### Bibliografisk note

Funding Information:Funding Pranabendu Misra: Supported by Google India Research Award 2022, and Start-Up Grant 2022 (SRG/2022/001927) of Science and Engineering Research Board (SERB), India. Saket Saurabh: Supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 819416), and Swarnajayanti Fellowship (No. DST/SJF/MSA01/2017-18).