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

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

17 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルAlgorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings
編集者Hee-Kap Ahn, Chan-Su Shin
出版社Springer Verlag
ページ553-564
ページ数12
ISBN(電子版)9783319130743
DOI
出版ステータス出版済み - 2014
イベント25th International Symposium on Algorithms and Computation, ISAAC 2014 - Jeonju, 韓国
継続期間: 12月 15 201412月 17 2014

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
8889
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他25th International Symposium on Algorithms and Computation, ISAAC 2014
国/地域韓国
CityJeonju
Period12/15/1412/17/14

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Depth-first search using O(n) bits」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル