scientific article; zbMATH DE number 54593
From MaRDI portal
Publication:4000686
Recommendations
Cited in
(22)- A unified approach to parallel depth-first traversals of general trees
- Parallel computation of matchings in trees
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application
- A simple optimal parallel algorithm for a core of a tree
- Tree-based parallel algorithm design
- scientific article; zbMATH DE number 4133492 (Why is no real title available?)
- Parallel Shortcutting of Rooted Trees
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
- Tree transformation problem in microparallelism algorithms
- scientific article; zbMATH DE number 4094808 (Why is no real title available?)
- scientific article; zbMATH DE number 88972 (Why is no real title available?)
- OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
- Recursive Star-Tree Parallel Data Structure
- scientific article; zbMATH DE number 1234617 (Why is no real title available?)
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- A Faster CREW PRAM Algorithm for Computing Cartesian Trees
- The parallel complexity of tree embedding problems (extended abstract)
- Algorithms and Computation
- Fast parallel reordering and isomorphism testing of \(k\)-trees
- Efficient parallel algorithms for some tree layout problems
- A parallel tree difference algorithm
- An optimal parallel algorithm forc-vertex-ranking of trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4000686)