A Note on Dynamic Bidirected Dyck-Reachability with Cycles
Programming Languages
2024-01-09 v1 Data Structures and Algorithms
Abstract
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 . 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 . This note discusses the cycle case and the time complexity.
Keywords
Cite
@article{arxiv.2401.03570,
title = {A Note on Dynamic Bidirected Dyck-Reachability with Cycles},
author = {Qirun Zhang},
journal= {arXiv preprint arXiv:2401.03570},
year = {2024}
}