Algorithms and data structures for first-order logic with connectivity under vertex failures

11/05/2021
by   Michał Pilipczuk, et al.
0

We introduce a new data structure for answering connectivity queries in undirected graphs subject to batched vertex failures. Precisely, given any graph G and integer k, we can in fixed-parameter time construct a data structure that can later be used to answer queries of the form: “are vertices s and t connected via a path that avoids vertices u_1,..., u_k?” in time 2^2^O(k). In the terminology of the literature on data structures, this gives the first deterministic data structure for connectivity under vertex failures where for every fixed number of failures, all operations can be performed in constant time. With the aim to understand the power and the limitations of our new techniques, we prove an algorithmic meta theorem for the recently introduced separator logic, which extends first-order logic with atoms for connectivity under vertex failures. We prove that the model-checking problem for separator logic is fixed-parameter tractable on every class of graphs that exclude a fixed topological minor. We also show a weak converse. This implies that from the point of view of parameterized complexity, under standard complexity assumptions, the frontier of tractability of separator logic is almost exactly delimited by classes excluding a fixed topological minor. The backbone of our proof relies on a decomposition theorem of Cygan et al. [SICOMP '19], which provides a tree decomposition of a given graph into bags that are unbreakable. Crucially, unbreakability allows to reduce separator logic to plain first-order logic within each bag individually. We design our model-checking algorithm using dynamic programming over the tree decomposition, where the transition at each bag amounts to running a suitable model-checking subprocedure for plain first-order logic. This approach is robust enough to provide also efficient enumeration of queries expressed in separator logic.

READ FULL TEXT

page 13

page 16

page 21

page 26

page 30

page 37

page 40

page 42

research
02/14/2023

Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes

Disjoint-paths logic, denoted 𝖥𝖮+𝖣𝖯, extends first-order logic (𝖥𝖮) with...
research
09/28/2017

Deobfuscating sparse graphs

We construct a fixed parameter algorithm parameterized by d and k that t...
research
05/02/2023

Connectivity Queries under Vertex Failures: Not Optimal, but Practical

We revisit once more the problem of designing an oracle for answering co...
research
08/07/2018

Good r-divisions Imply Optimal Amortised Decremental Biconnectivity

We present a data structure that given a graph G of n vertices and m edg...
research
03/09/2019

Timed Systems through the Lens of Logic

In this paper, we analyze timed systems with data structures, using a ri...
research
02/27/2022

A logic-based algorithmic meta-theorem for mim-width

We introduce a logic called distance neighborhood logic with acyclicity ...

Please sign up or login with your details

Forgot password? Click here to reset