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)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski
- ArXiv
- 2017

Depth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The… (More)

Is this relevant?

2004

2004

- Toshiaki Nishihara, Yasuhiko Minamide
- Archive of Formal Proofs
- 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)

Is this relevant?

1997

1997

- Pedro Meseguer
- IJCAI
- 1997

In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a… (More)

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)

Is this relevant?

1996

1996

- S. A. M. Makki, George Havas
- Inf. Process. Lett.
- 1996

We present distributed algorithms for constructing a depth-first search tree for a communication network which are more efficient… (More)

Is this relevant?

1995

1995

- David J. King, John Launchbury
- POPL
- 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

- Zeev Collin, Shlomi Dolev
- Inf. Process. Lett.
- 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

- S. Gill Williamson
- J. ACM
- 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)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- Robert E. Tarjan
- SIAM J. Comput.
- 1972

The value of depth-first search or "bacltracking" as a technique for solving problems is illustrated by two examples. An improved… (More)

Is this relevant?