### 抜粋

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

出版物ステータス | 出版済み - 1 1 2014 |

イベント | 25th International Symposium on Algorithms and Computation, ISAAC 2014 - Jeonju, 大韓民国 継続期間: 12 15 2014 → 12 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 |
---|---|

国 | 大韓民国 |

市 | Jeonju |

期間 | 12/15/14 → 12/17/14 |

### フィンガープリント

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### これを引用

*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); 巻数 8889). Springer Verlag. https://doi.org/10.1007/978-3-319-13075-0_44