Courcelle's Theorem Made Dynamic

02/16/2017
by   Patricia Bouyer-Decitre, et al.
0

Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic second-order formula over evolving subgraphs of a fixed maximal graph having bounded tree-width; here the subgraph evolves by losing or gaining edges (from the maximal graph). We show that this problem is in DynFO (with LOGSPACE precomputation), via a reduction to a Dyck reachability problem on an acyclic automaton.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/19/2023

On the Parameterized Complexity of Learning Monadic Second-Order Formulas

Within the model-theoretic framework for supervised learning introduced ...
research
04/11/2018

Bipartitioning Problems on Graphs with Bounded Tree-Width

For an undirected graph G, we consider the following problems: given a f...
research
04/28/2022

Twin-width and Limits of Tractability of FO Model Checking on Geometric Graphs

The complexity of the problem of deciding properties expressible in FO l...
research
11/12/2022

On maximal 3-edge-connected subgraphs of undirected graphs

We show how to find and efficiently maintain maximal 3-edge-connected su...
research
04/07/2019

A characterization of maximal 2-dimensional subgraphs of transitive graphs

A transitive graph is 2-dimensional if it can be represented as the inte...
research
10/07/2019

Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System

In this paper, we study a certain case of a subgraph isomorphism problem...
research
05/24/2020

On the impact of treewidth in the computational complexity of freezing dynamics

An automata network is a network of entities, each holding a state from ...

Please sign up or login with your details

Forgot password? Click here to reset