Parallel depth first search. II: Analysis

DOI10.1007/BF01389001zbMath0665.68049OpenAlexW1988185570MaRDI QIDQ1116344

Vipin Kumar, V. Nageshwara Rao

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/bf01389001

zbMATH Keywords

parallel algorithmsdepth first searchisoefficiency functionwork-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 (13)

\texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ Parallel depth first search. I: Implementation ⋮ Could we use a million cores to solve an integer program? ⋮ Scalability limits of Bag-of-Tasks applications running on hierarchical platforms ⋮ An optimization of tree topology based parallel cryptography ⋮ Efficient algorithms for parallel sorting on mesh multicomputers ⋮ A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations ⋮ Metrics for evaluation of parallel efficiency toward highly parallel processing ⋮ An Event-Driven Algorithm for Agents on the Web ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ Parallel state-space search for a first solution with consistent linear speedups ⋮ Anytime pack search ⋮ On the scalability of PSRS algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Depth-first iterative-deepening: An optimal admissible tree search
• Parallel depth first search. I: Implementation
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
• Anomalies in parallel branch-and-bound algorithms
• On Maintaining Dynamic Information in a Concurrent Environment

This page was built for publication: Parallel depth first search. II: Analysis