… This paper reports several properties of heuristic best-first search strategies whose scoring
functionsfdepend on all the information available from each candidate path, not merely on the …

… Best-first search is a general heuristic search algorithm that always expands next a
frontier node of lowest cost. It includes as special cases breadth-first search, Dijkstra's single-source …

Breadth‐First Search is an important kernel used by many graph‐processing applications.
In many of these emerging applications of BFS, such as analyzing social networks, the input …

… of depth-first search which retains the storage efficiency of sequential depth-first search and
can be … to be quite suitable for parallel depth-first search. Our experimental results show that …

… Backtracking, or depth-first search, is a technique which has … -first search. The set ofold
vertices with possibly unexplored edges may be stored on a stack. Thus a depth-first search is …

… -first search. Suppose we are given a rooted graph G with fixed adjacency lists and vertices
u, v. We wish to test if u is first visited before v in depth-first search … depth-first search ordering …

… This paper presents the analysis of a parallel formulation of depth-first search. At the heart
… be quite suitable for parallel depth-first search. Our analytical and experimental results show …

… To correct the algorithm it will suffice if we can guarantee that the second depth-first search
always explores the same states that are found in the first depth-first search. We will present …

… We introduce a new algorithm, K-best-first search (KBFS), which is a generalization of the
well known best-first search (BFS). In KBFS, each iteration simultaneously expands the K best …

… Recently, best-first search algorithms have been introduced that store their nodes on disk, to
… We also performed the first complete breadth-first search of the 4x4 Fifteen Puzzle, with over …