scientific article; zbMATH DE number 7375999

DOI10.4230/LIPICS.ICALP.2018.72zbMath1499.68274arXiv1805.00190MaRDI QIDQ5002751

Manoj Gupta, Aditi Singh

Publication date: 28 July 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

data structuresgraph algorithmsdistance oraclesfault-tolerant algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The k most vital arcs in the shortest path problem
• A data structure for dynamic trees
• Dual Failure Resilient BFS Structure
• Sparse Fault-Tolerant BFS Trees
• Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
• Replacement paths and k simple shortest paths in unweighted directed graphs
• Efficient Oracles and Routing Schemes for Replacement Paths
• Oracles for Distances Avoiding a Failed Node or Link
• Dynamic DFS in Undirected Graphs: breaking the O(m) barrier
• Multiple-edge-fault-tolerant approximate shortest-path trees
• Compact and Fast Sensitivity Oracles for Single-Source Distances
• Multiple Source Dual Fault Tolerant BFS Trees
• A nearly optimal oracle for avoiding failed vertices and edges
• Fault tolerant subgraph for single source reachability: generic and optimal

This page was built for publication: