Expected Performance of m-Solution Backtracking

DOI10.1137/0217008MaRDI QIDQ3777472zbMATH OpenOpenAlexFDO

Authors David M. Nicol

Publication date 1988

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2060/19860021764

zbMATH Keywords

backtrackingdepth-first searchrandom searchrandom treesseach tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 67459
• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• Performance of linear-space search algorithms
• scientific article; zbMATH DE number 2102781
• A sufficient condition for backtrack-bounded search

Cited in

(3)

• scientific article; zbMATH DE number 4178775 (Why is no real title available?)
• scientific article; zbMATH DE number 67459 (Why is no real title available?)
• Expected hitting times for Backtracking Adaptive Search

This page was built for publication: Expected Performance of m-Solution Backtracking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777472)