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

Title of this publication is not available (Why is that?)

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

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)

Cited In (18)

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

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)