Parallel depth first search. I: Implementation

DOI10.1007/BF01389000MaRDI QIDQ1116343zbMATH OpenOpenAlexFDO

Authors 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

depth-first searchparallel computersstate-space treesparallel formulationperformance resultswork distribution scheme

Mathematics Subject Classification ID

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

Recommendations

• Parallel depth first search. II: Analysis
• A parallel search algorithm for directed acyclic graphs
• scientific article; zbMATH DE number 1760141
• Parallel depth-bounded discrepancy search
• scientific article; zbMATH DE number 4090815
• A note on parallel depth first search
• Parallel Algorithms for Depth-First Searches I. Planar Graphs
• The scalability analysis of a parallel tree search algorithm
• scientific article; zbMATH DE number 1860736

Cites work

• scientific article; zbMATH DE number 4090815 (Why is no real title available?)
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
• Anomalies in parallel branch-and-bound algorithms
• Depth-first iterative-deepening: An optimal admissible tree search
• General branch and bound, and its relation to \(A^*\) and \(AO^*\)
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
• Parallel depth first search. II: Analysis

Cited in

(14)

• Scalable Parallel DFPN Search
• Parallel algorithms for a depth first search and a breadth first search
• Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
• A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
• A note on parallel depth first search
• Parallel depth first search. II: Analysis
• scientific article; zbMATH DE number 4090815 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 865205 (Why is no real title available?)
• On estimating workload in interval branch-and-bound global optimization algorithms
• Parallel multithreaded IDA\(*\) heuristic search: algorithm design and performance evaluation
• Graph representation of the fixed route dial-a-ride problem

This page was built for publication: Parallel depth first search. I: Implementation

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