Pages that link to "Item:Q3802639"
From MaRDI portal
The following pages link to Parallel algorithms for a depth first search and a breadth first search (Q3802639):
Displaying 15 items.
- Depth-first search is inherently sequential (Q1062456) (← links)
- A note on parallel depth first search (Q1075058) (← links)
- Fast parallel graph searching with applications (Q1103409) (← links)
- An improved parallel algorithm that computes the BFS numbering of a directed graph (Q1111392) (← links)
- Parallel depth first search. II: Analysis (Q1116344) (← links)
- Breadth-first traversal of trees and integer sorting in parallel (Q1186572) (← links)
- A model classifying algorithms as inherently sequential with applications to graph searching (Q1187028) (← links)
- Parallel search algorithms for graphs and trees (Q1204800) (← links)
- Distributed algorithms for depth-first search (Q1349993) (← links)
- Planar Depth-First Search in $O(\log n)$ Parallel Time (Q3474884) (← links)
- (Q3753485) (← links)
- Parallel Algorithms for Depth-First Searches I. Planar Graphs (Q3753502) (← links)
- (Q4872113) (← links)
- Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search (Q5949570) (← links)
- Deterministic parallel backtrack search (Q5958310) (← links)