Cover Image

A Note on Dynamic Bidirected Dyck-Reachability with Cycles

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Zhang, Qirun
Format:	Preprint
Published:	2024
Subjects:	Programming Languages Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Dynamic Algorithms to Predict Short Races
by: Zhang, Minjian, et al.
Published: (2026)

AbsInf: A Lightweight Object to Represent float('inf') in Dijkstra's Algorithm
by: Bellamkonda, Anjan, et al.
Published: (2025)

Diagram Control and Model Order for Sugiyama Layouts
by: Domrös, Sören, et al.
Published: (2024)

Implementing Binary Search Trees in GP 2 (Extended Abstract)
by: Alaoui, Ziad Ismaili, et al.
Published: (2026)

Optimizations and extensions for fair join pattern matching
by: Karras, Ioannis
Published: (2025)

Towards Efficient Hash Maps in Functional Array Languages
by: Due, William Henrich, et al.
Published: (2025)

Parsing Millions of URLs per Second
by: Nizipli, Yagiz, et al.
Published: (2023)

Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
by: Das, Debarati, et al.
Published: (2025)

Declarative Concurrent Data Structures
by: Raza, Aun, et al.
Published: (2024)

Deep Learning and Machine Learning -- Python Data Structures and Mathematics Fundamental: From Theory to Practice
by: Chen, Silin, et al.
Published: (2024)

Amortized Analysis via Coalgebra
by: Grodin, Harrison, et al.
Published: (2024)

Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling
by: Huang, Qunsheng, et al.
Published: (2024)

High-level quantum algorithm programming using Silq
by: Bezganovic, Viktorija, et al.
Published: (2024)

Quantum Backtracking in Qrisp Applied to Sudoku Problems
by: Seidel, Raphael, et al.
Published: (2024)

Improved Online Reachability Preservers
by: Bodwin, Greg, et al.
Published: (2024)

The Price of Universal Temporal Reachability
by: Bui-Xuan, Binh-Minh, et al.
Published: (2026)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
by: Prinz, Thomas M., et al.
Published: (2026)

A bargain for mergesorts -- How to prove your mergesort correct and stable, almost for free
by: Cohen, Cyril, et al.
Published: (2024)

Maximizing Reachability via Shifting of Temporal Paths
by: Deligkas, Argyrios, et al.
Published: (2026)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
by: Yang, Huihui, et al.
Published: (2025)

Polynomial Kernels with Reachability for Weighted $d$-Matroid Intersection
by: Huang, Chien-Chung, et al.
Published: (2026)

Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
by: Leutgeb, Lorenz, et al.
Published: (2022)

Corecursive Coding of High Computational Derivatives and Power Series
by: Karczmarczuk, Jerzy
Published: (2025)

Verified Purely Functional Catenable Real-Time Deques
by: Viennot, Jules, et al.
Published: (2025)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels
by: Deligkas, Argyrios, et al.
Published: (2021)

A Note on Deterministic FPTAS for Partition
by: Chen, Lin, et al.
Published: (2025)

Packing Short Cycles
by: Bentert, Matthias, et al.
Published: (2024)

The S-Hamiltonian Cycle Problem
by: Amarilli, Antoine, et al.
Published: (2026)

Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
by: Ashvinkumar, Vikrant, et al.
Published: (2026)

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
by: Assadi, Sepehr, et al.
Published: (2025)

A Note on Rounding Matchings in General Graphs
by: Dudeja, Aditi
Published: (2024)

A Note on Interdiction of Linear Minimization Problems
by: Cong, Yu, et al.
Published: (2026)

Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means
by: Dasdan, Ali
Published: (2025)

Fast Approximate Counting of Cycles
by: Censor-Hillel, Keren, et al.
Published: (2024)

A Note on the Conditional Optimality of Chiba and Nishizeki's Algorithms
by: Kirkpatrick, Yael, et al.
Published: (2024)

Listing 6-Cycles in Sparse Graphs
by: Williams, Virginia Vassilevska, et al.
Published: (2024)

Algorithms for Massive Data -- Lecture Notes
by: Prezza, Nicola
Published: (2023)

A Tight Lower Bound for Cycle Detection in Grid Graphs
by: Au, Andrew
Published: (2026)

A faster FPRAS for #NFA
by: Meel, Kuldeep S., et al.
Published: (2023)

Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
by: Aubian, Guillaume, et al.
Published: (2025)