Lower Bound on Expected Complexity of Depth-First Tree Search with Multiple Radii

Junil Ahn, Kiseon Kim. Lower Bound on Expected Complexity of Depth-First Tree Search with Multiple Radii. IEEE Communications Letters, 16(6):805-808, 2012. [doi]

Abstract

Abstract is missing.