Parallel depth first search. I: Implementation

DOI10.1007/BF01389000zbMath0665.68048OpenAlexW2031960564MaRDI QIDQ1116343

V. Nageshwara Rao, Vipin Kumar

Publication date: 1987

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

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

zbMATH Keywords

parallel computersdepth-first searchstate-space treesparallel formulationperformance resultswork distribution scheme

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25) Theory of software (68N99)

Related Items

Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers, On estimating workload in interval branch-and-bound global optimization algorithms, Parallel depth first search. II: Analysis, Graph representation of the fixed route dial-a-ride problem, A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations, Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation, Parallel state-space search for a first solution with consistent linear speedups, Anytime pack search, RANDOM SEEKING: A GENERAL, EFFICIENT, AND INFORMED RANDOMIZED SCHEME FOR DYNAMIC LOAD BALANCING

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• General branch and bound, and its relation to \(A^*\) and \(AO^*\)
• Depth-first iterative-deepening: An optimal admissible tree search
• Parallel depth first search. II: Analysis
• A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
• Anomalies in parallel branch-and-bound algorithms