Sparse Fault-Tolerant BFS Structures

DOI10.1145/2976741zbMath1445.68174OpenAlexW2530362908MaRDI QIDQ4962646

David Peleg, Merav Parter

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2976741

zbMATH Keywords

fault tolerancereplacement pathssingle source shortest paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (3)

Mincut sensitivity data structures for the insertion of an edge ⋮ Fault tolerant approximate BFS structures with additive stretch ⋮ Multiple-edge-fault-tolerant approximate shortest-path trees

This page was built for publication: Sparse Fault-Tolerant BFS Structures