Pages that link to "Item:Q795509"
From MaRDI portal
The following pages link to A parallel search algorithm for directed acyclic graphs (Q795509):
Displayed 10 items.
- A note on parallel depth first search (Q1075058) (← links)
- Prallel algorithms for analyzing activity networks (Q1090459) (← links)
- A random NC algorithm for depth first search (Q1104756) (← links)
- A parallel algorithm for recognizing unordered depth-first search (Q1111396) (← links)
- A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
- A model classifying algorithms as inherently sequential with applications to graph searching (Q1187028) (← links)
- Parallel search algorithms for graphs and trees (Q1204800) (← links)
- Criterion for a graph to admit a good orientation in terms of leaf blocks (Q2143270) (← links)
- Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (Q3060200) (← links)
- Parallel algorithms for connectivity problems in graph theory (Q3802645) (← links)