Improved distance sensitivity oracles with subcubic preprocessing time-Reference-Cited by-同舟云学术

Improved distance sensitivity oracles with subcubic preprocessing time

Author:

Ren Hanlin^ORCID

Funder

European Space Agency

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference22 articles.

2. Improved distance sensitivity oracles via tree partitioning;Duan,2017

3. Improved distance sensitivity oracles via random sampling;Bernstein,2008

4. A nearly optimal oracle for avoiding failed vertices and edges;Bernstein,2009

5. Tight hardness for shortest cycles and paths in sparse graphs;Lincoln,2018

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deep Distance Sensitivity Oracles;Studies in Computational Intelligence;2024

2. Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Approximate Distance Sensitivity Oracles in Subquadratic Space;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

5. Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failure;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10