Breadth-first traversal of trees and integer sorting in parallel
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 88969
- Parallel breadth-first search algorithms for trees and graphs
- Parallel algorithms for tree traversals
- scientific article; zbMATH DE number 4172414
- Parallel algorithms for a depth first search and a breadth first search
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Parallel algorithms with optimal speedup for bounded treewidth
- A unified approach to parallel depth-first traversals of general trees
- scientific article; zbMATH DE number 2100400
- Efficient parallel algorithms for breadth first spanning forests of general graphs
Cites work
- A taxonomy of binary tree traversals
- A unified approach to parallel depth-first traversals of general trees
- An Efficient Parallel Biconnectivity Algorithm
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Deterministic coin tossing with applications to optimal parallel list ranking
- scientific article; zbMATH DE number 4064468 (Why is no real title available?)
- scientific article; zbMATH DE number 88969 (Why is no real title available?)
- scientific article; zbMATH DE number 3481857 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Improved nonconservative sequential and parallel integer sorting
- Parallel algorithms for tree traversals
- Parallel breadth-first search algorithms for trees and graphs
- Parallel Computations in Graph Theory
- Towards optimal parallel bucket sorting
Cited in
(18)- An efficient algorithm to find next-to-shortest path on permutation graphs
- Parallel algorithms for tree traversals
- Radix sort trees in the large
- 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
- Breadth-first numbering
- scientific article; zbMATH DE number 4172414 (Why is no real title available?)
- On synchronizing tree automata and their work-optimal parallel run, usable for parallel tree pattern matching
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- Searching in Trees, Series-Parallel and Interval Orders
- scientific article; zbMATH DE number 88969 (Why is no real title available?)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs
- Computation of diameter, radius and center of permutation graphs
- Computation of minimum d-hop connected dominating set of trees in O(n) time
- An optimal algorithm for computing minimum k-hop dominating set of permutation graphs
- Minimum vertex-edge dominating set of permutation graphs
This page was built for publication: Breadth-first traversal of trees and integer sorting in parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186572)