The average complexity of depth-first search with backtracking and cutoff (Q3776618)

From MaRDI portal
Revision as of 01:27, 19 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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