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]
@article{AhnK12,
title = {Lower Bound on Expected Complexity of Depth-First Tree Search with Multiple Radii},
author = {Junil Ahn and Kiseon Kim},
year = {2012},
doi = {10.1109/LCOMM.2012.050912.120676},
url = {http://dx.doi.org/10.1109/LCOMM.2012.050912.120676},
researchr = {https://researchr.org/publication/AhnK12},
cites = {0},
citedby = {0},
journal = {IEEE Communications Letters},
volume = {16},
number = {6},
pages = {805-808},
}