Parallel depth first search. II: Analysis

DOI10.1007/BF01389001MaRDI QIDQ1116344zbMATH OpenOpenAlexFDO

Authors 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 software (68N99) Theory of operating systems (68N25)

Recommendations

• Parallel depth first search. I: Implementation
• Parallel Algorithms for Depth-First Searches I. Planar Graphs
• Planar Depth-First Search in $O(\log n)$ Parallel Time
• Parallel algorithms for a depth first search and a breadth first search
• Parallel breadth-first search algorithms for trees and graphs

Cites work

• scientific article; zbMATH DE number 4033059 (Why is no real title available?)
• scientific article; zbMATH DE number 4090815 (Why is no real title available?)
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• Anomalies in parallel branch-and-bound algorithms
• Depth-first iterative-deepening: An optimal admissible tree search
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
• On Maintaining Dynamic Information in a Concurrent Environment
• Parallel depth first search. I: Implementation

Cited in

(19)

• On the scalability of PSRS algorithm
• An optimization of tree topology based parallel cryptography
• Scalable Parallel DFPN Search
• Parallel algorithms for a depth first search and a breadth first search
• A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
• scientific article; zbMATH DE number 5642148 (Why is no real title available?)
• Parallel state-space search for a first solution with consistent linear speedups
• Anytime pack search
• The scalability analysis of a parallel tree search algorithm
• Parallel processing for difficult combinatorial optimization problems
• scientific article; zbMATH DE number 865205 (Why is no real title available?)
• scientific article; zbMATH DE number 1639653 (Why is no real title available?)
• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
• Could we use a million cores to solve an integer program?
• Parallel depth first search. I: Implementation
• An Event-Driven Algorithm for Agents on the Web
• Scalability limits of Bag-of-Tasks applications running on hierarchical platforms
• Metrics for evaluation of parallel efficiency toward highly parallel processing
• Efficient algorithms for parallel sorting on mesh multicomputers

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

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