Courcelle's Theorem Made Dynamic - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

Courcelle's Theorem Made Dynamic

Résumé

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.

Dates et versions

hal-01615275 , version 1 (12-10-2017)

Identifiants

Citer

Vincent Jugé, Patricia Bouyer-Decitre, Nicolas Markey. Courcelle's Theorem Made Dynamic. 2017. ⟨hal-01615275⟩
282 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More