Pages that link to "Item:Q1186572"
From MaRDI portal
The following pages link to Breadth-first traversal of trees and integer sorting in parallel (Q1186572):
Displaying 12 items.
- An efficient algorithm to find next-to-shortest path on permutation graphs (Q1034978) (← links)
- Radix sort trees in the large (Q1689831) (← 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)
- Breadth-first numbering (Q2943362) (← links)
- On Synchronizing Tree Automata and Their Work–Optimal Parallel Run, Usable for Parallel Tree Pattern Matching (Q3297787) (← links)
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs (Q3568416) (← links)
- Searching in Trees, Series-Parallel and Interval Orders (Q3756532) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
