Efficiency of randomized parallel backtrack search

DOI10.1007/PL00009269zbMATH Open0928.68036OpenAlexW2053665070MaRDI QIDQ1293867FDOQ1293867

Authors A. Ortynski, Yanjun Zhang 

Publication date 19 January 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00009269

zbMATH Keywords

randomized parallel backtrack search algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Recommendations

• A randomized parallel backtracking algorithm
• Deterministic parallel backtrack search
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Space-Efficient Parallel Algorithms for Combinatorial Search Problems
• scientific article; zbMATH DE number 2102781

Cited In (13)

• Tree search on an atomic model for message passing
• Deterministic parallel backtrack search
• Accelerating backtrack search with a best-first-search strategy
• Expected hitting times for Backtracking Adaptive Search
• Black-box Complexity of Parallel Search with Distributed Populations
• A randomized parallel backtracking algorithm
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Recent Advances in Constraints
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)

This page was built for publication: Efficiency of randomized parallel backtrack search

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