An efficient strongly connected components algorithm in the fault tolerant model

DOI10.1007/s00453-018-0452-3zbMath1418.68159arXiv1610.04010MaRDI QIDQ666658

Liam Roditty, Surender Baswana, Keerti Choudhary

Publication date: 11 March 2019

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

directed graph; fault tolerant; strongly connected components

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68M15: Reliability, testing and fault tolerance of networks and computer systems