The following pages link to (Q4000686):
Displaying 15 items.
- A parallel tree difference algorithm (Q673225) (← links)
- An optimal parallel algorithm forc-vertex-ranking of trees (Q834935) (← links)
- A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
- Parallel computation of matchings in trees (Q1179213) (← links)
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application (Q1198069) (← links)
- A simple optimal parallel algorithm for a core of a tree (Q1325996) (← links)
- Tree-based parallel algorithm design (Q1386764) (← links)
- (Q3034818) (← links)
- Tree transformation problem in microparallelism algorithms (Q3691058) (← links)
- OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES (Q4020276) (← links)
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width (Q4864433) (← links)
- A Faster CREW PRAM Algorithm for Computing Cartesian Trees (Q4924663) (← links)
- The parallel complexity of tree embedding problems (extended abstract) (Q5096766) (← links)
- Fast parallel reordering and isomorphism testing of \(k\)-trees (Q5956832) (← links)
- Efficient parallel algorithms for some tree layout problems (Q6085718) (← links)