scientific article; zbMATH DE number 6850433

zbMATH Open1403.68146MaRDI QIDQ4608014FDOQ4608014

Authors Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty

Publication date 15 March 2018

Full work available at URL http://dl.acm.org/citation.cfm?id=3175429

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Recommendations

• Approximate Single-Source Fault Tolerant Shortest Path
• Fault-tolerant approximate shortest-path trees
• Fault-tolerant approximate shortest-path trees
• Path-fault-tolerant approximate shortest-path trees
• A novel single source shortest path algorithm
• Multiple-edge-fault-tolerant approximate shortest-path trees
• Multiple-edge-fault-tolerant approximate shortest-path trees
• An efficient fault-containing self-stabilizing algorithm for the shortest path problem
• A forward-backward single-source shortest paths algorithm
• Fault Tolerant Approximate BFS Structures

Cited in

(18)

• Approximate shortest paths avoiding a failed vertex: optimal size data structures for unweighted graphs
• Multiple-edge-fault-tolerant approximate shortest-path trees
• An optimal dual fault tolerant reachability oracle
• Space efficient edge-fault tolerant routing
• Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
• Approximate Single-Source Fault Tolerant Shortest Path
• Efficient oracles and routing schemes for replacement paths
• Fault tolerant subgraph for single source reachability: generic and optimal
• Fault-tolerant approximate shortest-path trees
• Fault-tolerant subgraph for single-source reachability: general and optimal
• Fault-tolerant approximate shortest-path trees
• Generic single edge fault tolerant exact distance oracle
• Shortest path problems with node failures
• Multiple-edge-fault-tolerant approximate shortest-path trees
• Sparse weight tolerant subgraph for single source shortest path
• Path-fault-tolerant approximate shortest-path trees
• Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
• Single backup table schemes for shortest-path routing

This page was built for publication:

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