Fault tolerant reachability for directed graphs
From MaRDI portal
Publication:1664162
DOI10.1007/978-3-662-48653-5_35zbMath1394.68262OpenAlexW2293245492MaRDI QIDQ1664162
Surender Baswana, Keerti Choudhary, Liam Roditty
Publication date: 24 August 2018
Full work available at URL: https://doi.org/10.1007/978-3-662-48653-5_35
Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (5)
Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal ⋮ Approximating the smallest 2-vertex connected spanning subgraph of a directed graph ⋮ Dynamic Dominators and Low-High Orders in DAGs ⋮ Output sensitive fault tolerant maximum matching ⋮ Unnamed Item
This page was built for publication: Fault tolerant reachability for directed graphs
