Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs

Andrea Lincoln, Nikhil Vyas 0001. Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs. In Thomas Vidick, editor, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA. Volume 151 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Abstract

Abstract is missing.