Deterministic parallel backtrack search

DOI10.1016/S0304-3975(00)00386-8MaRDI QIDQ5958310zbMATH OpenFDO

Authors Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci

Publication date 3 March 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00386-8

zbMATH Keywords

backtrack searchload balancingparallel algorithmsPRAM model

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Efficiency of randomized parallel backtrack search
• A randomized parallel backtracking algorithm
• scientific article; zbMATH DE number 2102781
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• scientific article; zbMATH DE number 2084765
• A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees
• Parallel algorithms for a depth first search and a breadth first search
• Deterministic parallel DPLL

Cites work

• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• Deterministic branch-and-bound on distributed memory machines
• Dynamic Tree Embeddings in Butterflies and Hypercubes
• scientific article; zbMATH DE number 432837 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• Near‐perfect token distribution
• Optimal speedup for backtrack search on a butterfly network
• Randomized parallel algorithms for backtrack search and branch-and-bound computation

Cited in

(14)

• 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
• An analysis of budgeted parallel search on conditional Galton-Watson trees
• Effect of parallelism on the efficiency of binary tree search.
• scientific article; zbMATH DE number 3965422 (Why is no real title available?)
• 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 1555180 (Why is no real title available?)
• scientific article; zbMATH DE number 1860736 (Why is no real title available?)
• scientific article; zbMATH DE number 2100400 (Why is no real title available?)
• scientific article; zbMATH DE number 2102781 (Why is no real title available?)
• Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method

This page was built for publication: Deterministic parallel backtrack search

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