Limiting shape of the depth first search tree in an Erdős-Rényi graph.

Nathanaël Enriquez Gabriel Faraud Laurent Ménard

Published in: Random Struct. Algorithms (2020)

Keyphrases

search tree
depth first search
root node
search algorithm
search space
iterative deepening
branch and bound search
b tree
directed graph
branch and bound algorithm
tree search
backtracking algorithm
weighted graph
binary search trees
graph partitioning
information retrieval systems
computational complexity