arXiv
Open Access
2018
Fast Breadth-First Search in Still Less Space
Torben Hagerup
Abstrak
It is shown that a breadth-first search in a directed or undirected graph with $n$ vertices and $m$ edges can be carried out in $O(n+m)$ time with $n\log_2 3+O((\log n)^2)$ bits of working memory.
Topik & Kata Kunci
Penulis (1)
T
Torben Hagerup
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2018
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓