The average complexity of depth-first search with backtracking and cutoff (Q3776618)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The average complexity of depth-first search with backtracking and cutoff |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The average complexity of depth-first search with backtracking and cutoff |
scientific article |
Statements
The average complexity of depth-first search with backtracking and cutoff (English)
0 references
1986
0 references
depth-first search
0 references
binary trees
0 references
backtracking with cutoff
0 references
NP-complete problems
0 references
