Pages that link to "Item:Q5230310"
From MaRDI portal
The following pages link to Nearly work-efficient parallel algorithm for digraph reachability (Q5230310):
Displaying 4 items.
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
- On the parallel complexity of digraph reachability (Q1339381) (← links)
- (Q5116490) (← links)
- Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts (Q5157382) (← links)