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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1147/rd.303.0242 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043811185 / rank
 
Normal rank

Revision as of 23:54, 19 March 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