Skip to content

Author

C. Sasidharan

We have 1 of 18 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Conference 2026

Space Complexity of Reachability in Simple Path Graphs

In this work, the space complexity of reachability problem for restricted directed graph families is studied and the following results are shown.

K. Dinesh, C. Sasidharan, Michal Koucký et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.