Pages that link to "Item:Q1339381"
From MaRDI portal
The following pages link to On the parallel complexity of digraph reachability (Q1339381):
Displaying 6 items.
- Parallel processing of graph reachability in databases (Q688834) (← links)
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
- Graph-theoretical properties of parallelism in the digital plane (Q1861556) (← links)
- A note on the complexity of computing the number of reachable vertices in a digraph (Q2629773) (← links)
- MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters (Q5168515) (← links)
- Nearly work-efficient parallel algorithm for digraph reachability (Q5230310) (← links)