Breadth-first traversal of trees and integer sorting in parallel
From MaRDI portal
Publication:1186572
DOI10.1016/0020-0190(92)90078-AzbMath0743.68066WikidataQ127310388 ScholiaQ127310388MaRDI QIDQ1186572
Calvin C.-Y. Chen, Sajal K. Das
Publication date: 28 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items (9)
Computation of diameter, radius and center of permutation graphs ⋮ Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph ⋮ On Synchronizing Tree Automata and Their Work–Optimal Parallel Run, Usable for Parallel Tree Pattern Matching ⋮ An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs ⋮ A linear time algorithm to construct a tree 4-spanner on trapezoid graphs ⋮ An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs ⋮ An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs ⋮ An efficient algorithm to find next-to-shortest path on permutation graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved nonconservative sequential and parallel integer sorting
- Parallel algorithms for tree traversals
- A taxonomy of binary tree traversals
- Towards optimal parallel bucket sorting
- A unified approach to parallel depth-first traversals of general trees
- Parallel breadth-first search algorithms for trees and graphs
- An Efficient Parallel Biconnectivity Algorithm
- Deterministic coin tossing with applications to optimal parallel list ranking
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Parallel Computations in Graph Theory
This page was built for publication: Breadth-first traversal of trees and integer sorting in parallel
