Pages that link to "Item:Q1082819"

The following pages link to On efficient parallel strong orientation (Q1082819):

Displaying 14 items.

• Computational complexity of threshold automata networks under different updating schemes (Q475388) (← links)
• Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
• Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
• Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
• Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666) (← links)
• The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time (Q1104105) (← links)
• An efficient parallel algorithm for updating minimum spanning trees (Q1105383) (← links)
• The complexity of parallel search (Q1106664) (← links)
• Parallel search algorithms for graphs and trees (Q1204800) (← links)
• On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets (Q1327239) (← links)
• Finding level-ancestors in trees (Q1329158) (← links)
• Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881) (← links)
• Faster optimal parallel prefix sums and list ranking (Q1825647) (← links)
• Data-Oblivious Graph Algorithms in Outsourced External Memory (Q2942400) (← links)