Fast deterministic backtrack search

DOI10.1007/3-540-61440-0_162MaRDI QIDQ4818869zbMATH OpenFDO

Authors Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci

Publication date 24 September 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61440-0_162

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)

Recommendations

• Deterministic parallel backtrack search
• Space-Efficient Parallel Algorithms for Combinatorial Search Problems
• Optimal speedup for backtrack search on a butterfly network
• A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees
• Branch-and-bound and backtrack search on mesh-connected arrays of processors

Cited in

(11)

• Efficiency of randomized parallel backtrack search
• A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees
• Accelerating backtrack search with a best-first-search strategy
• scientific article; zbMATH DE number 5012413 (Why is no real title available?)
• A sufficient condition for backtrack-bounded search
• Expected Performance of m-Solution Backtracking
• scientific article; zbMATH DE number 4123296 (Why is no real title available?)
• Optimal speedup for backtrack search on a butterfly network
• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• scientific article; zbMATH DE number 1149402 (Why is no real title available?)
• Deterministic parallel backtrack search

This page was built for publication: Fast deterministic backtrack search

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