Courcelle's Theorem Made Dynamic
Computational Complexity
2017-02-20 v1 Formal Languages and Automata Theory
Abstract
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.
Cite
@article{arxiv.1702.05183,
title = {Courcelle's Theorem Made Dynamic},
author = {Patricia Bouyer-Decitre and Vincent Jugé and Nicolas Markey},
journal= {arXiv preprint arXiv:1702.05183},
year = {2017}
}
Comments
14 pages, 4 figures. arXiv admin note: text overlap with arXiv:1610.00571