[1]
Rose, K. et al. 2021. Best-First Search for Bounded-Depth Trees. Proceedings of the International Symposium on Combinatorial Search. 2, 1 (Aug. 2021), 134–141. DOI:https://doi.org/10.1609/socs.v2i1.18206.