Multiple-edge-fault-tolerant approximate shortest-path trees

DOI10.4230/LIPIcs.STACS.2016.18zbMath1388.68211arXiv1601.04169OpenAlexW2963927805MaRDI QIDQ4601870

Davide Bilò, Luciano Gualà, Guido Proietti, Stefano Leucci

Publication date: 24 January 2018

Full work available at URL: https://arxiv.org/abs/1601.04169

zbMATH Keywords

minimum spanning treedistance oraclefault-tolerant shortest-path tree

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Efficient Oracles and Routing Schemes for Replacement Paths ⋮ Unnamed Item ⋮ Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal ⋮ An efficient strongly connected components algorithm in the fault tolerant model ⋮ Unnamed Item ⋮ Fault-tolerant approximate shortest-path trees ⋮ Incremental distance products via faulty shortest paths ⋮ Sparse Weight Tolerant Subgraph for Single Source Shortest Path ⋮ Output sensitive fault tolerant maximum matching ⋮ Unnamed Item

This page was built for publication: Multiple-edge-fault-tolerant approximate shortest-path trees