A unified approach to parallel depth-first traversals of general trees
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 88969
- scientific article; zbMATH DE number 4172414
- A unified approach to the parallel construction of search trees
- Parallel algorithms for tree traversals
- scientific article; zbMATH DE number 2100400
- Parallel Depth-First Search in General Directed Graphs
- Parallel breadth-first search algorithms for trees and graphs
- scientific article; zbMATH DE number 54593
- Parallel algorithms for tree accumulations
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
Cites work
- A parallel search algorithm for directed acyclic graphs
- A taxonomy of binary tree traversals
- An Efficient Parallel Biconnectivity Algorithm
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Derivation of a parallel algorithm for balancing binary trees
- Deterministic coin tossing with applications to optimal parallel list ranking
- Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model
- Fast parallel graph searching with applications
- scientific article; zbMATH DE number 4172414 (Why is no real title available?)
- scientific article; zbMATH DE number 4155887 (Why is no real title available?)
- scientific article; zbMATH DE number 3481857 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree
- Parallel algorithms for tree traversals
- Parallel breadth-first search algorithms for trees and graphs
- Parallel Computations in Graph Theory
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
- The Parallel Evaluation of General Arithmetic Expressions
Cited in
(13)- Parallel algorithms for tree traversals
- Breadth-first traversal of trees and integer sorting in parallel
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application
- An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
- A unified approach to the parallel construction of search trees
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs
- scientific article; zbMATH DE number 4172414 (Why is no real title available?)
- scientific article; zbMATH DE number 88969 (Why is no real title available?)
- A parallel algorithm to generate all maximal independent sets on permutation graphs
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
This page was built for publication: A unified approach to parallel depth-first traversals of general trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178197)
