Sparse Fault-Tolerant BFS Structures

DOI10.1145/2976741MaRDI QIDQ4962646zbMATH OpenOpenAlexFDO

Authors M. Parter, David Peleg

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)

Recommendations

• Sparse fault-tolerant BFS trees
• Fault Tolerant Approximate BFS Structures
• Fault-tolerant approximate BFS structures
• Fault tolerant approximate BFS structures with additive stretch
• Fault tolerant spanners for general graphs
• Dual failure resilient BFS structure
• Fault-tolerant spanners for general graphs
• Fault-tolerant approximate shortest-path trees
• Fault-tolerant approximate shortest-path trees
• Multiple source dual fault tolerant BFS trees

Cited in

(13)

• Fault-tolerant approximate shortest-path trees
• Multiple-edge-fault-tolerant approximate shortest-path trees
• Mincut sensitivity data structures for the insertion of an edge
• Fault tolerant approximate BFS structures with additive stretch
• Dual failure resilient BFS structure
• Sparse fault-tolerant BFS trees
• Fault-tolerant approximate shortest-path trees
• Fault-tolerant approximate BFS structures
• Multiple source dual fault tolerant BFS trees
• Fault Tolerant Approximate BFS Structures
• Distributed constructions of dual-failure fault-tolerant distance preservers
• New fault tolerant subset preservers
• Deterministic replacement path covering

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962646)