2026-07-25T05:17:25Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:21116 2024-09-23T09:13:17Z ddc:004 open_access

Near Optimal Dual Fault Tolerant Distance Oracle Dey, Dipan Gupta, Manoj Distance Sensitive Oracle Dual Fault Distance Oracle We present a dual fault-tolerant distance oracle for undirected and unweighted graphs. Given a set F of two edges, as well as a source node s and a destination node t, our oracle returns the length of the shortest path from s to t that avoids F in O(1) time with a high probability. The space complexity of our oracle is Õ(n²) , making it nearly optimal in terms of both space and query time. Prior to our work, Pettie and Duan [SODA 2009] designed a dual fault-tolerant distance oracle that required Õ(n²) space and O(log n) query time. In addition to improving the query time, our oracle is much simpler than the previous approach. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Dipan Dey and Manoj Gupta 2024 Is Part Of LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ESA.2024.45 urn:nbn:de:0030-drops-211164 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.45 eng https://creativecommons.org/licenses/by/4.0/legalcode