Depth-first search using O(n) bits

Tetsuo Asano; Taisuke Izumi; Masashi Kiyomi; Matsuo Konagaya; Hirotaka Ono; Yota Otachi; Pascal Schweitzer; Jun Tarui; Ryuhei Uehara

doi:10.1007/978-3-319-13075-0_44

Depth-first search using O(n) bits

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

mathematics and information

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

11 Citations (Scopus)

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 [Formula presented], 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.

Original language	English
Title of host publication	Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings
Editors	Hee-Kap Ahn, Chan-Su Shin
Publisher	Springer Verlag
Pages	553-564
Number of pages	12
ISBN (Electronic)	9783319130743
DOIs	https://doi.org/10.1007/978-3-319-13075-0_44
Publication status	Published - 2014
Event	25th International Symposium on Algorithms and Computation, ISAAC 2014 - Jeonju, Korea, Republic of Duration: Dec 15 2014 → Dec 17 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8889
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	25th International Symposium on Algorithms and Computation, ISAAC 2014
Country	Korea, Republic of
City	Jeonju
Period	12/15/14 → 12/17/14

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-13075-0_44

Fingerprint Dive into the research topics of 'Depth-first search using O(n) bits'. Together they form a unique fingerprint.

Cite this

Asano, T., Izumi, T., Kiyomi, M., Konagaya, M., Ono, H., Otachi, Y., Schweitzer, P., Tarui, J., & Uehara, R. (2014). Depth-first search using O(n) bits. In H-K. Ahn, & C-S. Shin (Eds.), Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings (pp. 553-564). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8889). Springer Verlag. https://doi.org/10.1007/978-3-319-13075-0_44

Depth-first search using O(n) bits. / Asano, Tetsuo; Izumi, Taisuke; Kiyomi, Masashi; Konagaya, Matsuo; Ono, Hirotaka; Otachi, Yota; Schweitzer, Pascal; Tarui, Jun; Uehara, Ryuhei.

Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. ed. / Hee-Kap Ahn; Chan-Su Shin. Springer Verlag, 2014. p. 553-564 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8889).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Asano, T, Izumi, T, Kiyomi, M, Konagaya, M, Ono, H, Otachi, Y, Schweitzer, P, Tarui, J & Uehara, R 2014, Depth-first search using O(n) bits. in H-K Ahn & C-S Shin (eds), Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8889, Springer Verlag, pp. 553-564, 25th International Symposium on Algorithms and Computation, ISAAC 2014, Jeonju, Korea, Republic of, 12/15/14. https://doi.org/10.1007/978-3-319-13075-0_44

Asano T, Izumi T, Kiyomi M, Konagaya M, Ono H, Otachi Y et al. Depth-first search using O(n) bits. In Ahn H-K, Shin C-S, editors, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Springer Verlag. 2014. p. 553-564. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-13075-0_44

Asano, Tetsuo ; Izumi, Taisuke ; Kiyomi, Masashi ; Konagaya, Matsuo ; Ono, Hirotaka ; Otachi, Yota ; Schweitzer, Pascal ; Tarui, Jun ; Uehara, Ryuhei. / Depth-first search using O(n) bits. Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. editor / Hee-Kap Ahn ; Chan-Su Shin. Springer Verlag, 2014. pp. 553-564 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{35b8643a5db44a8491f3c31e401f6999,

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 [Formula presented], 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. Copyright: Copyright 2015 Elsevier B.V., All rights reserved.; 25th International Symposium on Algorithms and Computation, ISAAC 2014 ; Conference date: 15-12-2014 Through 17-12-2014",

year = "2014",

doi = "10.1007/978-3-319-13075-0_44",

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",

}

TY - GEN

T1 - Depth-first search using O(n) bits

AU - Asano, Tetsuo

AU - Izumi, Taisuke

AU - Kiyomi, Masashi

AU - Konagaya, Matsuo

AU - Ono, Hirotaka

AU - Otachi, Yota

AU - Schweitzer, Pascal

AU - Tarui, Jun

AU - Uehara, Ryuhei

PY - 2014

Y1 - 2014

N2 - 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 [Formula presented], 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.

AB - 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 [Formula presented], 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.

UR - http://www.scopus.com/inward/record.url?scp=84945186441&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84945186441&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-13075-0_44

DO - 10.1007/978-3-319-13075-0_44

M3 - Conference contribution

AN - SCOPUS:84945186441

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 553

EP - 564

BT - Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings

A2 - Ahn, Hee-Kap

A2 - Shin, Chan-Su

PB - Springer Verlag

T2 - 25th International Symposium on Algorithms and Computation, ISAAC 2014

Y2 - 15 December 2014 through 17 December 2014

ER -