Pages that link to "Item:Q1178197"
From MaRDI portal
The following pages link to A unified approach to parallel depth-first traversals of general trees (Q1178197):
Displaying 11 items.
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- Parallel algorithms for tree traversals (Q1064788) (← links)
- Breadth-first traversal of trees and integer sorting in parallel (Q1186572) (← links)
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application (Q1198069) (← links)
- An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs (Q1736757) (← links)
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365) (← links)
- A unified approach to the parallel construction of search trees (Q1898213) (← links)
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs (Q2574326) (← links)
- A parallel algorithm to generate all maximal independent sets on permutation graphs (Q4392327) (← links)
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs (Q4653706) (← links)
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967) (← links)