2000 character limit reached
A Note on Dynamic Bidirected Dyck-Reachability with Cycles
Published 7 Jan 2024 in cs.PL and cs.DS | (2401.03570v1)
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 $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.
- A new approach to incremental cycle detection and related problems. ACM Trans. Algorithms, 12(2):14:1–14:22, 2016.
- Optimal dyck reachability for data-dependence and alias analysis. Proc. ACM Program. Lang., 2(POPL):30:1–30:30, 2018. doi: 10.1145/3158118. URL https://doi.org/10.1145/3158118.
- On-the-fly static analysis via dynamic bidirected dyck reachability. CoRR, abs/2311.04319, 2023. doi: 10.48550/ARXIV.2311.04319. URL https://doi.org/10.48550/arXiv.2311.04319.
- Efficient algorithms for dynamic bidirected dyck-reachability. Proc. ACM Program. Lang., 6(POPL):1–29, 2022.
- Fast algorithms for dyck-cfl-reachability with applications to alias analysis. In Hans-Juergen Boehm and Cormac Flanagan, editors, ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI ’13, Seattle, WA, USA, June 16-19, 2013, pages 435–446. ACM, 2013.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
