Login / Signup
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
Published in:
ISAAC (2014)
Keyphrases
</>
depth first search
breadth first search
search tree
routing problem
iterative deepening
branch and bound
special case
search algorithm
spanning tree
tree search
dynamic programming
benchmark problems
database systems
multi dimensional