Dynamic Complexity of the Dyck Reachability
Computational Complexity
2017-04-18 v2
Abstract
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed and undirected graphs, where updates may add or delete edges. We show a strong dichotomy between such problems, based on the size of the Dyck alphabet. Some of them are P-complete (under a strong notion of reduction) while the others lie either in DynFO or in NL.
Cite
@article{arxiv.1610.07499,
title = {Dynamic Complexity of the Dyck Reachability},
author = {Patricia Bouyer and Vincent Jugé},
journal= {arXiv preprint arXiv:1610.07499},
year = {2017}
}
Comments
16 pages, 2 figures - Full version of FoSSaCS 2017 paper