Dynamic Complexity of the Dyck Reachability - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Dynamic Complexity of the Dyck Reachability

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 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.

Dates et versions

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

Identifiants

Citer

Vincent Jugé, Patricia Bouyer. Dynamic Complexity of the Dyck Reachability. 20th International Conference, Foundations of Software Science and Computation Structures 2017, Apr 2017, Uppsala, Sweden. ⟨10.1007/978-3-662-54458-7⟩. ⟨hal-01615264⟩
32 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More