@inbook{46c4ecf8fd3e4f7fa8670423049e98a0,

title = "Depth-First Search Using O(n) Bits",

abstract = "We provide algorithms performing Depth-First Search (DFS) on a directed or undirected graph with n vertices and m edges using only O(n) bits. One algorithm uses O(n) bits and runs in O(mlog n) time. Another algorithm uses n+o(n) bits and runs in polynomial time. Furthermore, we show that DFS on a directed acyclic graph can be done in space n/2Ω(√ log n) and in polynomial time, and we also give a simple linear-time O(log n)-space algorithm for the depth-first traversal of an undirected tree. Finally, we also show that for a graph having an O(1)- size feedback set, DFS can be done in O(log n) space. Our algorithms are based on the analysis of properties of DFS and applications of the s-t connectivity algorithms due to Reingold and Barnes et al., both of which run in sublinear space.",

author = "Tetsuo Asano and Taisuke Izumi and Masashi Kiyomi and Matsuo Konagaya and Hirotaka Ono and Yota Otachi and Pascal Schweitzer and Jun Tarui and Ryuhei Uehara",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2014.",

year = "2014",

doi = "10.1007/978-3-319-13075-044",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "553--564",

editor = "Hee-Kap Ahn and Chan-Su Shin",

booktitle = "Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings",

address = "Germany",

}