2-fault-tolerant strong connectivity oracles

DOI10.1137/1.9781611977929.7MaRDI QIDQ6545388zbMATH OpenFDO

Authors Loukas Georgiadis, Daniel Tsokaktsis

Publication date 29 May 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• Strong connectivity in directed graphs under failures, with applications
• Strong connectivity in directed graphs under failures, with applications
• Connectivity oracles for graphs subject to vertex failures
• Connectivity oracles for graphs subject to vertex failures
• An efficient strongly connected components algorithm in the fault tolerant model

This page was built for publication: 2-fault-tolerant strong connectivity oracles

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