Courcelle's Theorem Made Dynamic
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 secondorder formula over evolving subgraphs of a fixed maximal graph having bounded treewidth; 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.
 Publication:

arXiv eprints
 Pub Date:
 February 2017
 arXiv:
 arXiv:1702.05183
 Bibcode:
 2017arXiv170205183B
 Keywords:

 Computer Science  Computational Complexity;
 Computer Science  Formal Languages and Automata Theory
 EPrint:
 14 pages, 4 figures. arXiv admin note: text overlap with arXiv:1610.00571