Pages that link to "Item:Q1317488"
From MaRDI portal
The following pages link to Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488):
Displaying 5 items.
- Size-estimation framework with applications to transitive closure and reachability (Q1384531) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
- Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
- (Q5088964) (← links)
