Pages that link to "Item:Q4154064"

The following pages link to Parallel Computations in Graph Theory (Q4154064):

Displaying 16 items.

• Algorithms for some graph problems on a distributed computational model (Q580985) (← links)
• Traversing graphs in a paging environment, BFS or DFS? (Q751281) (← links)
• A parallel search algorithm for directed acyclic graphs (Q795509) (← links)
• A new distributed depth-first-search algorithm (Q1062756) (← links)
• Fast parallel graph searching with applications (Q1103409) (← links)
• A random NC algorithm for depth first search (Q1104756) (← links)
• Parallel algorithms for the single source shortest path problem (Q1162156) (← links)
• A constant-time parallel algorithm for computing convex hulls (Q1162818) (← links)
• A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
• Breadth-first traversal of trees and integer sorting in parallel (Q1186572) (← links)
• Parallel search algorithms for graphs and trees (Q1204800) (← links)
• A new class of parallel algorithms for finding connected components on machines with bit-vector operations (Q1328526) (← links)
• A parallel algorithm for surface-based object reconstruction (Q2273355) (← links)
• Parallel breadth-first search algorithms for trees and graphs (Q3318124) (← links)
• New fast parallel algorithm for the connected component problem and its VLSI implementation (Q3358233) (← links)
• An 0(log n) parallel algorithm for strong connectivity augmentation problem (Q3804208) (← links)