bidirectional search

Summary

bidirectional search is a search algorithm^[1]. It draws 45 Wikipedia views per month (search_algorithm category, ranking #10 of 19).^[2]

Key Facts

• bidirectional search's instance of is recorded as search algorithm^[3].
• bidirectional search's instance of is recorded as graph algorithm^[4].
• bidirectional search's instance of is recorded as optimal search algorithm^[5].
• bidirectional search's instance of is recorded as complete search algorithm^[6].
• bidirectional search's Commons category is recorded as Algorithms^[7].
• bidirectional search's Freebase ID is recorded as /m/08w36p^[8].
• bidirectional search's worst-case time complexity is recorded as O(b^{d/2})^[9].
• bidirectional search's worst-case time complexity is recorded as O(b^{d/2}+b^{d/2})^[10].
• bidirectional search's worst-case space complexity is recorded as O(b^{d/2})^[11].
• bidirectional search's worst-case space complexity is recorded as O(b^{d/2}+b^{d/2})^[12].
• bidirectional search's Microsoft Academic ID is recorded as 831591^[13].
• bidirectional search's OpenAlex ID is recorded as C831591^[14].

Body

Designation and Status

Recorded instance of include search algorithm^[3], graph algorithm^[4], optimal search algorithm^[5], and complete search algorithm^[6].

Why It Matters

bidirectional search draws 45 Wikipedia views per month (search_algorithm category, ranking #10 of 19).^[2] It has Wikipedia articles in 10 language editions, a strong signal of global cultural recognition.^[15]