A randomized parallel backtracking algorithm

DOI10.1109/12.9745MaRDI QIDQ3814842zbMATH OpenOpenAlexFDO

Authors Virendra K. Janakiram, Dharma P. Agrawal, Ravi Mehrotra

Publication date 1988

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.9745

zbMATH Keywords

backtrackingmultiprocessingparallel algorithmsPROLOGrandomized algorithms

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Efficiency of randomized parallel backtrack search
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• A randomized parallel branch-and-bound algorithm
• scientific article; zbMATH DE number 1304350
• scientific article; zbMATH DE number 4047072

Cited in

(8)

• A randomized parallel branch-and-bound algorithm
• Efficiency of randomized parallel backtrack search
• Random backtracking in backtrack search algorithms for satisfiability
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• scientific article; zbMATH DE number 1860736 (Why is no real title available?)
• scientific article; zbMATH DE number 934538 (Why is no real title available?)
• Deterministic parallel backtrack search
• Parallel Logic Programming: A Sequel

This page was built for publication: A randomized parallel backtracking algorithm

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