The average complexity of depth-first search with backtracking and cutoff (Q3776618): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 12:47, 5 February 2024

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
    0 references
    0 references
    1986
    0 references
    depth-first search
    0 references
    binary trees
    0 references
    backtracking with cutoff
    0 references
    NP-complete problems
    0 references

    Identifiers