Pages that link to "Item:Q673083"
From MaRDI portal
The following pages link to Optimal parallel algorithms for path problems on planar graphs (Q673083):
Displaying 8 items.
- Parallel complexity of computing a maximal set of disjoint paths (Q1186594) (← links)
- A linear algorithm for the all-bidirectional-edges problem on planar graphs (Q1209732) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220) (← links)
- Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph (Q1908264) (← links)
- Bidirectional edges problem. I: A simple algorithm (Q1908265) (← links)
- On the complexity of optimal parallel cooperative path-finding (Q2805441) (← links)
- Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model' (Q3493247) (← links)
- A simple parallel algorithm for the single-source shortest path problem on planar digraphs (Q5926351) (← links)