A parallel search algorithm for directed acyclic graphs
DOI10.1007/BF01937481zbMATH Open0542.68049OpenAlexW1978615272MaRDI QIDQ795509FDOQ795509
Authors: Ratan K. Ghosh, G. P. Bhattacharjee 
Publication date: 1984
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01937481
Recommendations
directed acyclic graphparallel algorithmspanning treeSIMDshared memory modelantilexicographicdepth-first searchingtraversal algorithms
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)
Cites Work
- Title not available (Why is that?)
- Depth-First Search and Linear Graph Algorithms
- Gaussian elimination is not optimal
- The ILLIAC IV Computer
- Title not available (Why is that?)
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Parallel Computations in Graph Theory
- New Parallel-Sorting Schemes
- On the Parallel Evaluation of Polynomials
- Finding Dominators in Directed Graphs
- Parallel Solution of Recurrence Problems
- Parallel Algorithms in Graph Theory: Planarity Testing
- Merging with parallel processors
- Title not available (Why is that?)
Cited In (16)
- Parallel algorithms for connectivity problems in graph theory
- Randomized parallel algorithms
- Title not available (Why is that?)
- A parallel algorithm for recognizing unordered depth-first search
- A unified approach to parallel depth-first traversals of general trees
- Sequential and parallel solution-biased search for subgraph algorithms
- Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
- Criterion for a graph to admit a good orientation in terms of leaf blocks
- A random NC algorithm for depth first search
- On computing the number of topological orderings of a directed acyclic graph
- Parallel depth first search. I: Implementation
- Parallel search algorithms for graphs and trees
- A model classifying algorithms as inherently sequential with applications to graph searching
- Parallel algorithms for a depth first search and a breadth first search
- Prallel algorithms for analyzing activity networks
- A note on parallel depth first search
This page was built for publication: A parallel search algorithm for directed acyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795509)
