Depth-first search

Known as: Forward edge, Depth first search, Depth-first 
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1971-2018
010203019712018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Depth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
Depth-first search of a graph is formalized with function. It is shown that it visits all of the reachable nodes from a given… (More)
Is this relevant?
2000
2000
In this paper, we present a novel discrepancy-based search technique implemented as an instance of the generic search procedures… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a… (More)
  • figure 1
  • figure 4
  • figure 5
Is this relevant?
1997
1997
In this paper we take a general look at forward pruning in tree search. By identifying what we think are desirable… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
1996
1996
We present distributed algorithms for constructing a depth-first search tree for a communication network which are more efficient… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
1995
1995
Depth-first search is the key to a wide variety of graph algorithms. In this paper we express depth-first search in a lazy… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
A distributed algorithm is self-stabilizing if it can be started from any possible global state. Once started, the algorithm… (More)
Is this relevant?
1984
1984
Lel G = (V, E) be a nonplanar graph. The method of using depth-first techniques to extract a Kuratowski .,;ubgraph in time O( I V… (More)
  • figure I
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1972
Highly Cited
1972
The value of depth-first search or "bacltracking" as a technique for solving problems is illustrated by two examples. An improved… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?