Image de couverture de livre

Algorithms for Distance Sensitivity Oracles and other Graph Problems on the PRAM

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Manoharan, Vignesh, Ramachandran, Vijaya
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Distributed Distance Sensitivity Oracles
par: Manoharan, Vignesh, et autres
Publié: (2024)

Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
par: Manoharan, Vignesh, et autres
Publié: (2022)

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
par: Manoharan, Vignesh, et autres
Publié: (2023)

Improved Distance (Sensitivity) Oracles with Subquadratic Space
par: Bilò, Davide, et autres
Publié: (2024)

Approximate Distance Sensitivity Oracles in Subquadratic Space
par: Bilò, Davide, et autres
Publié: (2023)

Improved Algorithms for Clustering with Noisy Distance Oracles
par: Pradhan, Pinki, et autres
Publié: (2026)

Path-Reporting Distance Oracles for Vertex-Labeled Graphs
par: Neiman, Ofer, et autres
Publié: (2026)

Faster Algorithms for $(2k-1)$-Stretch Distance Oracles
par: Kadria, Avi, et autres
Publié: (2025)

Hamming Distance Oracle
par: Boneh, Itai, et autres
Publié: (2024)

A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles
par: Harada, Kaito, et autres
Publié: (2024)

Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs
par: Ahi, Mridul, et autres
Publié: (2025)

Optimal Sensitivity Oracle for Steiner Mincut
par: Bhanja, Koustav
Publié: (2024)

Path-Reporting Distance Oracles with Linear Size
par: Neiman, Ofer, et autres
Publié: (2024)

Nearly Optimal Fault Tolerant Distance Oracle
par: Dey, Dipan, et autres
Publié: (2024)

Matroid Algorithms Under Size-Sensitive Independence Oracles
par: Banihashem, Kiarash, et autres
Publié: (2026)

New Diameter Approximations via Distance Oracle Techniques
par: Kirkpatrick, Yael, et autres
Publié: (2026)

Near Optimal Dual Fault Tolerant Distance Oracle
par: Dey, Dipan, et autres
Publié: (2024)

Fault-Tolerant Approximate Distance Oracles with a Source Set
par: Dey, Dipan, et autres
Publié: (2025)

On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch
par: Kopelowitz, Tsvi, et autres
Publié: (2023)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
par: Łącki, Jakub, et autres
Publié: (2025)

Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions
par: Horowicz, Noam, et autres
Publié: (2025)

Fault-Tolerant Distance Oracles Below the $n \cdot f$ Barrier
par: Khanna, Sanjeev, et autres
Publié: (2026)

Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity
par: Long, Yaowei, et autres
Publié: (2024)

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
par: Eisenbrand, Friedrich, et autres
Publié: (2024)

Lossless Derandomization for Undirected Single-Source Shortest Paths and Approximate Distance Oracles
par: Yan, Shuyi
Publié: (2025)

Faster Construction of a Planar Distance Oracle with Õ(1) Query Time
par: Boneh, Itai, et autres
Publié: (2025)

Graph Reconstruction with a Connected Components Oracle
par: Harviainen, Juha, et autres
Publié: (2025)

Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares
par: Bathie, Gabriel, et autres
Publié: (2023)

Algorithms for Distance Problems in Continuous Graphs
par: Cabello, Sergio, et autres
Publié: (2025)

Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle
par: Baswana, Surender, et autres
Publié: (2023)

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n)
par: Elkin, Michael, et autres
Publié: (2023)

Fast Algorithms for Graph Arboricity and Related Problems
par: Cen, Ruoxu, et autres
Publié: (2025)

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
par: Haeupler, Bernhard, et autres
Publié: (2024)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
par: Mu, Ta-Yu, et autres
Publié: (2024)

Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs
par: Kumar, Akash, et autres
Publié: (2026)

Improved Algorithms for Distance Selection and Related Problems
par: Wang, Haitao, et autres
Publié: (2023)

Range Counting Oracles for Geometric Problems
par: Driemel, Anne, et autres
Publié: (2025)

Minimum+1 Steiner Cuts and Dual Edge Sensitivity Oracle: Bridging the Gap between Global cut and (s,t)-cut
par: Bhanja, Koustav
Publié: (2024)

Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime
par: Kociumaka, Tomasz, et autres
Publié: (2025)

Fully Dynamic Algorithms for Chamfer Distance
par: Goranci, Gramoz, et autres
Publié: (2025)