Pages that link to "Item:Q1111396"
From MaRDI portal
The following pages link to A parallel algorithm for recognizing unordered depth-first search (Q1111396):
Displaying 8 items.
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- Depth-first search is inherently sequential (Q1062456) (← links)
- A note on parallel depth first search (Q1075058) (← links)
- A random NC algorithm for depth first search (Q1104756) (← links)
- Parallel \(N\)-free order recognition (Q1392213) (← links)
- Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph (Q3357536) (← links)
- (Q4871265) (← links)
- (Q4872113) (← links)