Strong Connectivity in Directed Graphs under Failures, with Applications

Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis. Strong Connectivity in Directed Graphs under Failures, with Applications. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pages 1880-1899, SIAM, 2017. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.