دورية أكاديمية
Dynamic Complexity of Reachability: How Many Changes Can We Handle?
| العنوان: | Dynamic Complexity of Reachability: How Many Changes Can We Handle? |
|---|---|
| المؤلفون: | Datta, Samir, Kumar, Pankaj, Mukherjee, Anish, Tawari, Anuj, Vortmeier, Nils, Zeume, Thomas |
| المساهمون: | Samir Datta and Pankaj Kumar and Anish Mukherjee and Anuj Tawari and Nils Vortmeier and Thomas Zeume |
| بيانات النشر: | Schloss Dagstuhl – Leibniz-Zentrum für Informatik |
| سنة النشر: | 2020 |
| المجموعة: | DROPS - Dagstuhl Research Online Publication Server (Schloss Dagstuhl - Leibniz Center for Informatics ) |
| مصطلحات موضوعية: | Dynamic complexity, reachability, complex changes |
| الوصف: | In 2015, it was shown that reachability for arbitrary directed graphs can be updated by first-order formulas after inserting or deleting single edges. Later, in 2018, this was extended for changes of size (log n)/(log log n), where n is the size of the graph. Changes of polylogarithmic size can be handled when also majority quantifiers may be used. In this paper we extend these results by showing that, for changes of polylogarithmic size, first-order update formulas suffice for maintaining (1) undirected reachability, and (2) directed reachability under insertions. For classes of directed graphs for which efficient parallel algorithms can compute non-zero circulation weights, reachability can be maintained with update formulas that may use "modulo 2" quantifiers under changes of polylogarithmic size. Examples for these classes include the class of planar graphs and graphs with bounded treewidth. The latter is shown here. As the logics we consider cannot maintain reachability under changes of larger sizes, our results are optimal with respect to the size of the changes. |
| نوع الوثيقة: | article in journal/newspaper conference object |
| وصف الملف: | application/pdf |
| اللغة: | English |
| العلاقة: | Is Part Of LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020); urn:nbn:de:0030-drops-125291; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.122Test |
| DOI: | 10.4230/LIPIcs.ICALP.2020.122 |
| الإتاحة: | https://doi.org/10.4230/LIPIcs.ICALP.2020.122Test https://nbn-resolving.org/urn:nbn:de:0030-drops-125291Test |
| حقوق: | https://creativecommons.org/licenses/by/3.0/legalcodeTest |
| رقم الانضمام: | edsbas.B92A1CEA |
| قاعدة البيانات: | BASE |
| DOI: | 10.4230/LIPIcs.ICALP.2020.122 |
|---|