A Note on Dynamic Bidirected Dyck-Reachability with Cycles
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917561099091968 |
|---|---|
| author | Zhang, Qirun |
| author_facet | Zhang, Qirun |
| contents | Recently, Li et al. [2022] presented a dynamic Dyck-reachability algorithm for bidirected graphs. The basic idea is based on updating edge weights in a data structure called the merged graph $G_m$. As noted in Krishna et al. [2023], the edge deletion procedure described in the algorithm of Li et al. [2022] cannot properly update the weights in the presence of cycles in $G_m$. This note discusses the cycle case and the time complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_03570 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Note on Dynamic Bidirected Dyck-Reachability with Cycles Zhang, Qirun Programming Languages Data Structures and Algorithms Recently, Li et al. [2022] presented a dynamic Dyck-reachability algorithm for bidirected graphs. The basic idea is based on updating edge weights in a data structure called the merged graph $G_m$. As noted in Krishna et al. [2023], the edge deletion procedure described in the algorithm of Li et al. [2022] cannot properly update the weights in the presence of cycles in $G_m$. This note discusses the cycle case and the time complexity. |
| title | A Note on Dynamic Bidirected Dyck-Reachability with Cycles |
| topic | Programming Languages Data Structures and Algorithms |
| url | https://arxiv.org/abs/2401.03570 |