Imagen de Portada

Path-Reporting Distance Oracles for Vertex-Labeled Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Neiman, Ofer, Spector, Alon
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Path-Reporting Distance Oracles with Linear Size
por: Neiman, Ofer, et al.
Publicado: (2024)

A Unified Framework for Hopsets and Spanners
por: Neiman, Ofer, et al.
Publicado: (2021)

New Oracles and Labeling Schemes for Vertex Cut Queries
por: Jiang, Yonggang, et al.
Publicado: (2025)

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n)
por: Elkin, Michael, et al.
Publicado: (2023)

Lightweight Near-Additive Spanners
por: Gitlitz, Yuval, et al.
Publicado: (2024)

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

Hamming Distance Oracle
por: Boneh, Itai, et al.
Publicado: (2024)

Space Complexity of Vertex Connectivity Oracles
por: Pettie, Seth, et al.
Publicado: (2022)

Algorithms for Distance Sensitivity Oracles and other Graph Problems on the PRAM
por: Manoharan, Vignesh, et al.
Publicado: (2025)

Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
por: Li, Xizhe, et al.
Publicado: (2026)

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2025)

Distributed Distance Sensitivity Oracles
por: Manoharan, Vignesh, et al.
Publicado: (2024)

Optimal Distance Labeling for Permutation Graphs
por: Gawrychowski, Paweł, et al.
Publicado: (2024)

Connectivity Oracles for Predictable Vertex Failures
por: Hu, Bingbing, et al.
Publicado: (2023)

Improved Algorithms for Clustering with Noisy Distance Oracles
por: Pradhan, Pinki, et al.
Publicado: (2026)

Improved Distance (Sensitivity) Oracles with Subquadratic Space
por: Bilò, Davide, et al.
Publicado: (2024)

Approximate Distance Sensitivity Oracles in Subquadratic Space
por: Bilò, Davide, et al.
Publicado: (2023)

Nearly Optimal Fault Tolerant Distance Oracle
por: Dey, Dipan, et al.
Publicado: (2024)

New Diameter Approximations via Distance Oracle Techniques
por: Kirkpatrick, Yael, et al.
Publicado: (2026)

Near Optimal Dual Fault Tolerant Distance Oracle
por: Dey, Dipan, et al.
Publicado: (2024)

Faster Algorithms for $(2k-1)$-Stretch Distance Oracles
por: Kadria, Avi, et al.
Publicado: (2025)

Fault-Tolerant Approximate Distance Oracles with a Source Set
por: Dey, Dipan, et al.
Publicado: (2025)

On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch
por: Kopelowitz, Tsvi, et al.
Publicado: (2023)

Fault-Tolerant Distance Oracles Below the $n \cdot f$ Barrier
por: Khanna, Sanjeev, et al.
Publicado: (2026)

Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions
por: Horowicz, Noam, et al.
Publicado: (2025)

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
por: Bhanja, Koustav, et al.
Publicado: (2025)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
por: Bentert, Matthias, et al.
Publicado: (2024)

Cluster Vertex Deletion on Chordal Graphs
por: Cao, Yixin, et al.
Publicado: (2026)

Faster Construction of a Planar Distance Oracle with Õ(1) Query Time
por: Boneh, Itai, et al.
Publicado: (2025)

Graph Reconstruction with a Connected Components Oracle
por: Harviainen, Juha, et al.
Publicado: (2025)

Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies
por: Long, Yaowei, et al.
Publicado: (2024)

A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles
por: Harada, Kaito, et al.
Publicado: (2024)

The Connected k-Vertex One-Center Problem on Graphs
por: Zhang, Jingru
Publicado: (2024)

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs
por: Ahi, Mridul, et al.
Publicado: (2025)

Exact Algorithms for Distance to Unique Vertex Cover
por: Fioravantes, Foivos, et al.
Publicado: (2025)

Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
por: Fischer, Olivier, et al.
Publicado: (2025)

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
por: Balakrishnan, Girish, et al.
Publicado: (2024)

Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs
por: Chen, Yu, et al.
Publicado: (2024)

Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs
por: Kumar, Akash, et al.
Publicado: (2026)