Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Bidirectional_search> ?p ?o }
Showing triples 1 to 30 of
30
with 100 triples per page.
- Bidirectional_search abstract "Bidirectional search is a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph. It runs two simultaneous searches: one forward from the initial state, and one backward from the goal, stopping when the two meet in the middle. The reason for this approach is that in many cases it is faster: for instance, in a simplified model of search problem complexity in which both searches expand a tree with branching factor b, and the distance from start to goal is d, each of the two searches has complexity O(bd/2) (in Big O notation), and the sum of these two search times is much less than the O(bd) complexity that would result from a single search from the beginning to the goal.As in A* search, bi-directional search can be guided by a heuristic estimate of the remaining distance to the goal (in the forward tree) or from the start (in the backward tree).Ira Pohl (1971) was the first one to design and implement a bi-directional heuristic search algorithm. Andrew Goldberg and others explained the correct termination conditions for the bidirectional version of Dijkstra’s Algorithm.".
- Bidirectional_search wikiPageID "3157516".
- Bidirectional_search wikiPageRevisionID "598221479".
- Bidirectional_search hasPhotoCollection Bidirectional_search.
- Bidirectional_search subject Category:Graph_algorithms.
- Bidirectional_search subject Category:Search_algorithms.
- Bidirectional_search type Abstraction100002137.
- Bidirectional_search type Act100030358.
- Bidirectional_search type Activity100407535.
- Bidirectional_search type Algorithm105847438.
- Bidirectional_search type Event100029378.
- Bidirectional_search type GraphAlgorithms.
- Bidirectional_search type Procedure101023820.
- Bidirectional_search type PsychologicalFeature100023100.
- Bidirectional_search type Rule105846932.
- Bidirectional_search type SearchAlgorithms.
- Bidirectional_search type YagoPermanentlyLocatedEntity.
- Bidirectional_search comment "Bidirectional search is a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph. It runs two simultaneous searches: one forward from the initial state, and one backward from the goal, stopping when the two meet in the middle.".
- Bidirectional_search label "Bidirectional search".
- Bidirectional_search label "Bidirektionale Suche".
- Bidirectional_search label "Двунаправленный поиск".
- Bidirectional_search label "双方向探索".
- Bidirectional_search sameAs Bidirektionale_Suche.
- Bidirectional_search sameAs 双方向探索.
- Bidirectional_search sameAs m.08w36p.
- Bidirectional_search sameAs Q59750.
- Bidirectional_search sameAs Q59750.
- Bidirectional_search sameAs Bidirectional_search.
- Bidirectional_search wasDerivedFrom Bidirectional_search?oldid=598221479.
- Bidirectional_search isPrimaryTopicOf Bidirectional_search.