A Lower Bound on Cycle-Finding in Sparse Digraphs

Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun. A Lower Bound on Cycle-Finding in Sparse Digraphs. In Shuchi Chawla 0001, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. pages 2936-2952, SIAM, 2020. [doi]

Abstract

Abstract is missing.